Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How can fritz fill 200-300Mbytes hash tables in rapid chess?

Author: Tom Kerrigan

Date: 11:37:49 06/21/98

Go up one level in this thread


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



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.