Author: Vincent Diepeveen
Date: 17:25:18 06/21/98
Go up one level in this thread
On June 21, 1998 at 14:37:49, Tom Kerrigan wrote: >On June 21, 1998 at 13:08:40, Vincent Diepeveen wrote: > >>You can fill 300MB easily. >>Especially fritz. >>If you don't clean your hashtable (and fritz doesn't do this), then >>you have 30 minutes to fill it. With around 300k nodes a second > >Well, this may be true, assuming you don't clear the hash table. (Does Fritz >clear it or not?) > >On the other hand, the memory may be totally useless. If you're considering the >entire 30 minutes of the game (which you are), you have positions from minute 1 >in your table. Those usually don't prove useful to the program 29 minutes later. > >Cheers, >Tom When i see the number of nodes of diep: 7k-12k a second at a Pro, and the hash size: 60MB, from which about 4M tuples, then i should not get a huge speed up of a huge hashtable, yet 30MB gives different results especially in endgame. You probably have heart of chaining. this is the problem. so small depths gets overwritten because of chaining, although hashtable is far from full, not even approaching it. Further note that there are a lot of rook endings where progression may take several tens of moves, which takes care that search before it was very useful. Vincent.
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.