Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Efficient hash algorithm?

Author: John Coffey

Date: 15:56:46 09/21/98

Go up one level in this thread


On September 21, 1998 at 18:12:36, Tom Kerrigan wrote:

>Mostly correct, although maintaining two numbers to describe the position is
>overkill. One 64 bit number should be enough.
>

Is one 64 bit number enough to uniquely identify a position?  Does this
prevent two positions from getting the same hash key?

I assume that you convert your hash key into an index into the history.
I assume that you take your 64 bit number and divide it by a constant
(or right shift it) to get the number of entries available in your hash
table?  i.e. 64 megs would be 4 million positions.

John Coffey



This page took 0.01 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.