Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hash Table Size Versus Performance.

Author: Mark Young

Date: 15:54:18 05/30/98

Go up one level in this thread


On May 30, 1998 at 09:56:25, Robert Hyatt wrote:

>On May 30, 1998 at 02:28:02, Steven Juchnowski wrote:
>
>>How much does hash table size effect performance?
>>
>>On one hand we hear that Fritz5 can gain about 40 ELO points by
>>increasing the hash size from 44MB to 100MB.
>>
>>On the other hand there are claims that doubling the hash size will
>>only improve performance by a few ELO points.
>>
>>I assume the above claims are based on tournament time controls.
>>
>>So which is the real picture, or is it perhaps that the sensitivity of
>>hash
>>size on performance varies from program to program.
>>
>>Regards
>
>
>there are at least a couple of things that could make Fritz far more
>sensitive to hash table size than other programs:
>
>(1) a poor replacement strategy.  If this is true, then a larger table
>reduces replacement, which would produce better performance.
>
>(2) using the table for other things besides the normal score/best move/
>etc.  If this is true, replacing *any* entry could be bad, depending on
>what is stored in the table.
>
>no one knows what Fritz does, but one of the above reasons is almost
>certain to be correct.  I'd suspect (2) myself, since replacement
>strategies are well-known now.

What other things could Fritz be putting in the hash tables? If he needs
hash tables for other things. Why can't he do something like you do with
Pawn hash.
That way he could use replacement strategies on the normal hash tables.



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.