Re: [computer-go] A superko paradox

[Darren Cook <darren@xxxxxxxxx>]

> 2. How many board positions can be hashed before
> the same hash occurs for two different boards?
>
> ...For other applications,
> such as joseki libraries, question 2 is more relevant.
Also when trying to prove anything. I'm just switching to using a 96+32-bit 
hash. If the 96 bit hash matches then I assert that the 32-bit hash for the 
two positions also matches.

If the assert fails then it tells me my hash size is not big enough for what 
I'm trying to do (*) so I know to move to the next size up. There is a one 
in 4-billion chance that two positions will be different but my assert will 
not trigger.

Darren

*: If it ever happens I'll try and remember to post the two positions.
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/