Computer Chess Club Archives


Search

Terms

Messages

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

Author: Vincent Diepeveen

Date: 17:33:02 06/21/98

Go up one level in this thread



On June 21, 1998 at 15:59:33, Moritz Berger wrote:

>On June 21, 1998 at 14:26:38, Ernst A. Heinz 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 [...]
>>
>>Vincent,
>>
>>You are the first to claim that "Fritz" does *not* clear its hash tables
>>after each move. Up to version 4, "Fritz" definitely did it ...
>>
>>Where do you get your knowledge from?
>>
>>According to my own experiences when playing "Fritz 5" I guess that it
>>still clears its tables -- the first iterations just do not seem to fly
>>by as they should if the tables remained intact.
>>
>>=Ernst=
>
>I observed that Fritz doesn't neccessarily find its own move from a previously
>computed very deep PV (e.g. 15 ply or something) in the next move very soon. So
>not even move ordering at depth-2 ply seems to be used. I certainly don't know
>for sure, but would like to know Vincent's source of information. Maybe it's
>gonna be news even for Frans Morsch ...

Try fritz3 first.
Easier to see there.

>Moritz



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.