On Fri, Jan 19, 2007 at 10:46:07AM -0500, Don Dailey wrote: > > On Fri, 2007-01-19 at 12:00 -0200, Mark Boon wrote: > > What ticked me off with the cuckoo method is apparently it can loop > > and a rehash is needed. Ouch, that better not happen very often! > > The whole point is that this cost is extremely tiny when amortized > over the run time of the whole algorithm. In other words, the > analysis of how efficient the algorithm considers this time. > > So the answer is that it is indeed a rare occurrence - a fraction > of a percent of your run time.
That also means that you have to keep enough data in each node to recalculate the hash keys from, for example the board position etc. Maybe it would be enough to keep the zobrist hash of the position, and use different bits of it for the hash key, or a different modulus, or something. -H -- Heikki Levanto "In Murphy We Turst" heikki (at) lsd (dot) dk _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
