Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashtables: is larger always better?

Author: Sune Fischer

Date: 06:05:42 09/23/01

Go up one level in this thread


On September 23, 2001 at 08:02:15, Sune Fischer wrote:


I need to correct myself here.

>To simplify lets say we have a 2^63 size hash table, now you would have
>a 50% chance of a "collision", but what you have been asking is:
>the key that is here, is that the same as my key?
>You are not asking if the key corresponds to the same position, how would you
>even ask such a question without more detailed information about the position?

Actually this is wrong.

Uri I think you were completely right.
If we have N keys in the table, then the chance of generating a similar one
must be N/2^64. It is as simple as that and it was exactly what you said.

I thought for a moment the entry would filter out the others and what remained
was only to compare a single 64 bit key. Of cause it does not.

I stand corrected.

-S.



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.