Computer Chess Club Archives


Search

Terms

Messages

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

Author: Don Dailey

Date: 18:50:19 06/21/98

Go up one level in this thread


>Indeed weird, where fritz3 seems to suffer from this, fritz5 seems to repeat
>itself
>over and over again. Weird. So fritz3 not cleaning and fritz5 does.
>
>So it has become even dumber, now relying on piece square tables.
>That explains quite a number of things.
>.
>>Moritz

I have a theory.  I believe Fritz has gotten smarter.  But I know
Franz is not likely to give up much speed to attain this.  I'll bet
he is using some "fuzzy" (no I don't mean fuzzy logic) techniques
to achieve this speed and get more dynamic evaluation.  There are
fast techniques available that use incremental updating but can
be move ordering dependent.  If he were doing this then it might
be smart to clear the hash tables between moves.

It's a stretch I admit, but what the hell ...

- Don



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.