Author: Pat King
Date: 04:58:19 09/22/98
Go up one level in this thread
On September 21, 1998 at 19:33:18, John Coffey wrote: >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. Yes, but in most other applications, the hash table is much less likely to be full, and the data much less likely to be old. In chess, collisions are rampant, and so an effective replacement policy has to be more important than rehashing or linear probing or other collision schemes, because you're just NOT going to find an empty slot. Pat
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.