Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashtables: is larger always better?

Author: Uri Blass

Date: 22:54:14 09/24/01

Go up one level in this thread


On September 24, 2001 at 22:35:49, Robert Hyatt wrote:

>On September 24, 2001 at 18:44:04, Uri Blass wrote:
>
>>If the probability is really 1/2^64 for every new node then you are not getting
>>one hash collison for every few billion nodes.
>
>There is no way to produce perfectly random hash distributions.

I assumed that it is possible to do it but sune fischer explained clearly in his
post that the probability is not 1/2^64 and is bigger if the hash table is
bigger

see http://www.icdchess.com/forums/1/message.shtml?190205

Uri



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.