On Thu, Aug 20, 2009 at 9:06 AM, Jason House<jason.james.ho...@gmail.com> wrote: > I changed my search from one tree per search thread to a shared (lock-free) > tree among all threads. Back with dedicated trees, I would set a visited > flag as I walked the tree. With a shared tree are there any clever ways to > detect cycles / super ko?
In dimwit we had a `hash_set<u64>' structure to remember the hash keys of the positions visited, of which each thread can have its own. A more clever thing to do might be to use a Bloom filter, and only do the more expensive test (e.g., comparing the current's position hash with the hashes of all the positions in the history) if it passes. Álvaro. _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
