On Thu, Oct 9, 2008 at 9:26 AM, Don Dailey <[EMAIL PROTECTED]> wrote: > If you use zobrist hashing, it is probably not ridiculously slow to do > this. And if your play-outs are pretty heavy anyway, the cost will be > negligible as you say.
Has anyone tried to use a Bloom filter ( http://en.wikipedia.org/wiki/Bloom_filter ) for this? It would very quickly tell you that most positions are not repetitions, and leave only a tiny fraction of positions to test in a deterministic way. Álvaro. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
