Author: John Coffey
Date: 16:33:18 09/21/98
Go up one level in this thread
>You should also have two hash tables, one with an "always overwrite" >replacement >policy and another with a replacement policy based on depth. Almost everybody I >know agrees that this is the best way to do things on a PC. When I studied hashing for other types of applications, the rule would be that if you has two items with the same hash key, then you would store the second in the next available empty slot. This requires more data to keep track of where the next item is (could be a byte offset.) John Coffey
This page took 0.01 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.