Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Efficient hash algorithm?

Author: John Coffey

Date: 16:54:53 09/21/98

Go up one level in this thread


On September 21, 1998 at 19:45:21, José de Jesús García Ruvalcaba wrote:

>On September 21, 1998 at 19:35:39, William H Rogers wrote:
>

>>That is why I suggested a smaller hash key of only 16 bits. That gives you 64K
>>which is a lot for a smaller program. Think about it 64 thousand opening book
>>replys. But the other boy are correct, if you have the space.
>
>	What has to do the opening book with the hash tables? Are the opening book
>positions stored in the hash tables somehow, at the beggining of the game?

There is some confusion here.  *MY* questions about hash tables have to do
with the posiition history for move searching.  But hashing can also be
used as a way of storing opening moves.  It has the advantage that it
recognizes transpositions.

john coffey



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.