Author: blass uri
Date: 23:41:51 08/25/98
Go up one level in this thread
On August 25, 1998 at 17:35:18, Amir Ban wrote: >On August 25, 1998 at 11:48:50, blass uri wrote: > >>I want to know after how much time the hash tables of Junior are full >>(Fritz5 gives me this information). >> > >Unlike Fritz, hash table overcommitment is not a great liability and not an >important event, and I don't want to give this impression to the users. I am not sure if this is unlike fritz. I think fritz5's programmers give a wrong impression to the users about hash tables. Telling the users after how much time the hash tables are full is not giving a wrong impression about it. Fritz5 progrmmers give a wrong impression because of the manual that tell us it is not a good idea to run the program when the hash tables are full. The nunn match with 23Mbytes hash tables per program gives an evidence that fritz5 probably earns from time when the hash tables are full more than hiarcs6 when the hash tables of hiarcs6 are not full. 6:4 for hiarcs6 with 67 seconds per move 8.5:1.5 for fritz5 with 200 seconds per move when the hash tables of fritz5 are full after near 67 seconds per move. Uri > > >>I see that if I give Junior big hash tables it needs time to begin to think so >>too big hash tables are counter productive and I want to know what >>is the optimal hash tables per time. >> > >We have Microsoft to thank for this effect. There's no real reason for this, and >I hope it will disappear in Win98. > >I used 40 mB in Paris, 80 mB in the Dov Porat tournament, and I normally use >around 8-16 mB in blitz. > >Amir
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.