Re: computer-go: ko [was: Applying Moore's Law to Computer Go]

[Dave Dyer <ddyer@xxxxxxxxxxx>]

>  Could somebody please give me some pointers on where to find 
>information on zobrist hashing (besides getting hold of his thesis).
>
The basic idea is to assign two random numbers to each square, one
for black and one for white.  XOR the random numbers for all the 
occupied squares, and the result is very likely to be unique for
that position.


     [Zobrist 70] A New Hashing Method with Application for Game Playing. 
     Zobrist, A.L. Tech. rep. 88, Univ. of Wisconsin, April 1970.