On Wed, Apr 8, 2009 at 2:07 PM, Isaac Deutsch <i...@gmx.ch> wrote: > > What I don't understand is: How do you know from just a single xor hash > if you have played a certain position/color before? Don't you somehow have > to store for each possible hash (which is 2 bytes in my example) if it has > been used before? The amount of possible hashes even for 2 bytes is quite > large. >
Like any hash function, multiple board positions can hash to the same value. The idea is that the probability of encountering two board positions in the same game that have the same hash value is so low, that if you get a duplicate hash value you are practically guaranteed that it's a superko. Colin _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
