Computer Chess Club Archives




Subject: Re: Detecting Draws using a Small Hash Table?

Author: Dan Andersson

Date: 05:52:27 02/20/02

Go up one level in this thread

You don't need a big hash table at all. A table roughly the size
2*(reversible-moves+depth of search should be enough).
When you check a position you hash it and look up the slot.
If it's empty you store the value and return false.
If it is a match you return true.
Else you rehash the value and do a new lookup.
And whenever you unmake a move you remove the value from the slot.
The only tricky part is the remove hash value function. And that makes a linear
search of hash values about as efficient in regular cases.

MvH Dan Andersson

This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.