Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question: Hashtable formula

Author: Paulo Soares

Date: 22:41:56 04/05/99

Go up one level in this thread


On April 05, 1999 at 23:13:26, Steven Juchnowski wrote:

>
>On April 05, 1999 at 20:49:55, Paulo Soares wrote:
>
>>Is the formula below, that is on the Fritz5 manual,
>>a generic formula, or either, it can be applied
>>to optimize hashtables of any program?
>>
>>
>>		HT(Kb)=2.0*Pfreq(Mgz)*t(S)
>>
>>	HT= optimized hashtable size in Kb.
>>	Pfreq= clock speed of the processor in Mgz.
>>	t= average time avaiable per move in seconds.
>>
>>If this is not a generic formula, exists a specific
>>formula for each program?
>>
>>
>>Best regards,
>>
>>Paulo Soares, from Brazil
>
>The equation is specifically formulated for Fritz5.
>Slower searchers such as Hiarcs7 will take more time to
>fill the hash table. The constant  in the equation will
>need to be reduced for a slow searcher like Hiarcs7.
>
>The equation is probably not terribly accurate as the type of
>processor also needs to be considered. For example a
>Pentium 200 MMX is faster than a Pentium 200, hence a
>larger hash table would be required for the MMX  than what the
>equation would predict.
>
>Regards
>
>Steven Juchnowski


Steven,

You are rigth.
You find that the formula for Fritz5 could be adjusted for any
program, for a factor related with the number of nodes for second?

Regards,

Paulo Soares



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.