Re: computer-go: Huima's hash function

[uzsxtn@xxxxxxxxxxx]

On Thu, 12 Sep 2002, Jeffrey Rainy wrote:

> Having two tables of (19x19) values in the range that pleases you ( say 32
> bits ). One table will be labeled Black and the other White.  Initialise
> both tables with random values.
>
> To evaluate the hash value, start with a value of 0, and for each point on
> the board where there is a stone, XOR your current value, with the
> corresponding value of the Black or White table according to the stone
> color.  By corresponding value, I mean to index into the table with the
> stone position.

This is exactly what is used in GNU Go; I'd guess in most other Go
programs too. (Just 64 bit instead of 32.)

Regards,
Arend

--
Arend Bayer