Author: Russell Reagan
Date: 00:11:29 12/27/02
Go up one level in this thread
On December 27, 2002 at 02:52:43, Bruce Moreland wrote: >I suggest that the best way to do this is to make a small hash table and insert >hash keys of previously seen positions into it when a node is entered, and >remove them with the node is left. > >The table does not need to be large, since depth of search is not infinite. A >small table won't blow cache. > >It can be large enough that collisions are rare. Collisions are handled by >moving to the next element, anyway. What do you mean by "Collisions are handled by moving to the next element"? This is where things get unclear for me. I understand how a hash table works, how the keys are generated, how you index the array with a portion of the key, and so on. But when people start talking about "replacement schemes" and "I use an 8-probe method" and other similar statements like yours above, I get lost. Maybe now is a good time to get all of that straight. Would you mind explaining? Russell
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.