Author: Harald Faber
Date: 02:29:35 06/14/99
Go up one level in this thread
On June 13, 1999 at 14:09:24, Eran wrote: >Is the formula below correct? > >HT[KB] = 0.2 * Pfreq[MHz] * t[s] > >HT is the hashtable size in kilobytes, Pfreq is the clock speed of the processor >in MHz, and t the time available per move in seconds. > >Example: Average time per move of 30 minutes (1800 seconds) on a Pentium 200 >will require: > >HT = 0.2 * 200 * 1800 = 72000 KB = 72 MB > >Or > >Example: Tournament games with an average of three minutes (180 seconds) per >move on a Pentium 200 will require: > >HT = 0.2 * 200 * 180 = 7200 KB = 7.2 MB > >However, Hiarcs 7.32 does retain information in the hashtable memory even >between moves. So it sounds to me that the information is built up until full >in the hashtable memory while Hiarcs 7.32 is playing thru several moves ahead. >Is that correct? Is Hiarcs 7.32 very smart with hashtable memory? > >Eran As written in Computer Schach und Spiele 3/1999 Hiarcs doesn't clear the hashtables and therefore most possible hash is best.
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.