Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hash table size - is a power of 2 still an advantage these days?

Author: Uri Blass

Date: 07:43:56 09/25/03

Go up one level in this thread


On September 25, 2003 at 09:48:33, Tord Romstad wrote:

>On September 24, 2003 at 16:28:57, Robert Hyatt wrote:
>
>>I try to use _most_ of main memory for serious games, and if you have a
>>1 gig machine, I generally use something like hash=784M, hashp=40M,
>>cache=128M, and go from there...
>
>Interesting.  Is a 40M pawn hash table really useful for Crafty?  How big
>are your pawn hash entries?  My pawn hash table contains just 256 entries,
>where each entry is 128 bytes.  The last time I tried, increasing the size
>of the table gave just a very small speedup (less than 2%, if I recall
>correctly).
>
>Tord

I think that other programmers care about every 1%

The question is what information the pawn hash give.

If it is only information about pawn structure then I think that the difference
between 4 mbytes and 40 mbytes is less than 1% but the difference may be bigger
if the information is also about other things like squares of the kings or other
information that is not dependent on pawns(for example pawns that are blocked by
another pawn).

I also think that people who hash evaluation and not information may get better
speed improvement.

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.