Author: Bert
Date: 13:09:36 01/17/98
Go up one level in this thread
Yes, if your hash table is too large, you will get to hear a lot of disk
seeks, not just on the first move out of book, but very often
thereafter. When correctly sized, you should hear a lot of seeks on the
first move of the first game out of book, and nothing more after that.
Here is the formula that ChessBase supplies for Fritz 5 to help
calculate hash table size:
HT(KB)=2.0*Pfreq(mhz)*t(s)
HT is the hash table size.
Pfreq(mhz) is the clock speed of the processor in mhz.
t is the time available per move in seconds.
They give the example of a tournament with an average of 3 minutes per
move on a Pentium 200, which requires a HT size of 72mb.
The faster the processor, the larger the multiplier, and the larger the
HT required. You quickly run out of resources on a normal PC.
In other words, in order to get deeper searches beyond the limits of our
current chess programs running on processors in the 200mhz range, we
will need chess programs that use a different design approach from what
we have today. The current set bears islimited by the design philosophy
that pits large hash tables against processor speed.
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.