Re: [computer-go] Re: Sharing Secrets

[Arthur Cater <arthur.cater@xxxxxx>]

> Now, my "secret" lies in the fact that I have found an improvement 
> to the hard-to-find accepted solution to the fact that random values 
> suck as Zobrist hash keys. So, there is a solution to the big 
> problem of random values as hash keys, there are in fact several 
> "solutions", and even the best published one is still sub-par.

Well you're a tease!

My Z-hasher regenerates numbers found to have a Hamming Distance less
than X from any other number; and regenerates numbers found to be in
a cycle-of-three under XOR. It iterates until satisfied.
Then it allocates the numbers in a spiral from the centre, ensuring
that no number is allocated that has Hamming distance less than Y,
where Y >X, for any of the numbers already allocated in the ZxZ square
of surrounding spots. This is done once, offline.

I don't claim credit for the Hamming Distance ideas, (I don't remember
now just where I got them, but it was somewhere on WWW) or (likewise)
the cycle-of-three.

The spiral allocation was my own idea, others may easily have beaten me
to it, I'm a newcomer. It may not even be great! But, in a spirit of 
sharing ...

BTW I use a pair of Lisp fixnums, less therefore than 64 bits.

Arthur
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/