> 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


Yes, that is clear, but Lukasz didn't mention how he stores the past hash
values. Sorry if my statement was not clear.

Isaac
-- 
Psssst! Schon vom neuen GMX MultiMessenger gehört? Der kann`s mit allen: 
http://www.gmx.net/de/go/multimessenger01
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/

Reply via email to