Author: Reinhard Scharnagl
Date: 01:52:33 11/24/02
Go up one level in this thread
> Or even if we do a mod, to completely avoid collisions, we could use store a > pointer to a linked list at the position. This way, multiple positions mapping > to the same index in the table would not overwrite but instead be stored in a > linked list. Scan the linked list to find a key. A faster work around to store more conflicting data would be in the case of a collision to SHIFT or XOR the address-part with a special randomizing word and to try storing or recalling localized at the resulting alternate address. When then nevertheless a double conflict would be detected, you have the chance to decide, which replacement should be avoided, having the goal to keep a maximum of any calculated information. Reinhard Scharnagl
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.