Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hash table collisions

Author: Bruce Moreland

Date: 12:46:35 01/15/00

Go up one level in this thread


On January 15, 2000 at 13:29:41, James Robertson wrote:

>On January 15, 2000 at 12:54:15, Bruce Moreland wrote:
>
>>On January 15, 2000 at 09:40:51, James Swafford wrote:
>>
>>>If you use 20 bits to probe, why not just store the other 44 bits in the
>>>table as a checksum?  You already know the other 20 bits match....
>>
>>What I do in mine is I use the bottom however many bits to probe, and I store
>>the top 32 bits.  So I lose some bits unless my table hits 2^32 elements, which
>>is not likely for a while at least.
>
>What is your collision rate?
>
>James

I have no idea.  I think that it makes sense that I check, but I haven't.

bruce



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.