1. A set is created containing exactly
one hex vector.
2. A vector V is randomly chosen from
the vectors already in the set.
3. A copy of V is made, call it W.
4. Independently of all of the other
elements of W, each element of W is
either left alone (with probability
0.5) or changed (again with
probability 0.5) to one of the other
15 possible hex values, each of the
15 being equally likely to be chosen.
5. W is added to the set. We will call
V the predecessor of W.
6. If the set has fewer than 100
vectors, go to step 2.
7. Stop
[/code]
The resulting set of 100 hex vectors is
given below in random order. For each
vector, find which line in the list
contains its immediate predecessor. If
you think that a vector is the one
placed in the set by step 1 above, put
0 as the line number of its predecessor.
As your answer, specify the list of
predecessors as indices in the vector
list. So, for example, if your answer
starts 67,18,1,0,18.... then you are
saying that the first vector in the list
had the 67th vector as its predecessor;
the second and fifth both had 18 as
predecessor; the third had the first as
predecessor; the fourth on the list was
made by step 1 and has no predecessor.
Your score in this contest is how many
correctly identified predecessors are
in your list. I suspect that is nearly
impossible to get all 100 correct, but
I'm interested in finding out how well
the predecessor list can be
reconstructed.

## Question

## superprismatic

A set of 50-long vectors whose elements

are hexadecimal numbers is created as

follows:

## Link to comment

## Share on other sites

## 7 answers to this question

## Recommended Posts

## Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.