Ah, that's what you mean. :) Actually I don't care too much about superko. I just care about the move the genmove returns. It would be better If I check at least some part of MCTS tree. I just replay the game to check whether there is a hash collision. (I use 64 bits)
If I would wan't fast checking I would probably use bloom filter. http://en.wikipedia.org/wiki/Bloom_filter Lukasz On Wed, Apr 8, 2009 at 20:59, Isaac Deutsch <i...@gmx.ch> wrote: > >> 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/ > _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
