Re: [computer-go] A superko paradox

["Frank de Groot" <frank@xxxxxxxxxxxxx>]

> While most ko detections are easy (if this point has never been
> captured, playing here can't violate ko), I occasionally have to check
> if the current configuration has occurred before.  While most of these
> checks are quick Zobrist hash comparisons, occasionally two positions
> will hash to the same value.  Thus, I have to store the entire board
> configuration with each move.  This is a frequent, expensive operation
> to deal with a situation that is very rare, but can happen.
>
> Is there any way out of this?

Use 64-bit hashes with optimal distribution.

On average you would have to generate 1x10E18 positions before you encounter
a collision.

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