Author: Eran
Date: 14:38:22 06/13/99
Go up one level in this thread
On June 13, 1999 at 15:24:44, Ernst Walet wrote: >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 > >But as different CPU's (pentium, pentium mmx, k6, pii etc.) perform different at >the same clock speed, this formula isn't worth much, is it? > >Ernst-J. Well, getting the right answer for hashtable is not easy. My computer has 72MB RAM and Hiarcs 7.32 gets about 45MB hashtable. Other chess programs such as Rebel10, Fritz5.32, Junior5, etc. fill up its hashtable memory on each turn. After that, its hashtable memory gets empty again and ready for next turn. It is not the samething as Hiarcs 7.32. It is the only chess program that does retain some or all information in its hashtable memory even between moves. So after each turn Hiarcs's hashtable will have less and less memory available for next move because from turn to next turn some information is "stuck" inside the hashtable memory. I am wondering what happen when the hashtable gets full and it no longer has some memory left for next move. I don't know whether Hiarcs 7.32 is smart in handling with hashtable memory very effectively. What I try to point out is that deep correspondence analysis for example may need good hashtable capacity, right? Without hashtable memory at all might make Hiarcs 7.32 somewhat weaker especially in overnight analysis games for instance. Eran
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.