Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hash table collisions

Author: Andreas Herrmann

Date: 23:24:09 11/23/02

Go up one level in this thread


On November 23, 2002 at 21:20:11, Arshad F. Syed wrote:

>On November 23, 2002 at 20:53:00, Arshad F. Syed wrote:
>
>>Why do we even bother doing a mod to get the index? Why not just use the random
>>number generated as index? At least the chances of collision are lesser than
>>when doing a mod.
>>
>>Thanks,
>>Arshad
>
>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.
>
>Thanks,
>Arshad

because the scanning of such a list would be much too slow.

Andreas





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.