Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Neverending story with incomplete tablebases

Author: Johan de Koning

Date: 23:03:28 08/14/03

Go up one level in this thread


On August 14, 2003 at 12:12:37, Dieter Buerssner wrote:

>On August 14, 2003 at 02:51:36, Johan de Koning wrote:
>
>>On August 13, 2003 at 17:53:30, Dieter Buerssner wrote:
>
>>>What are the other good reasons for clearing TTs?
>>
>>1. Predictability
>>   IMHO an engine should just search when a search is needed.
>>   After all it is a tool, not a living creature.
>
>Thanks for you answer. All more or less points, I could imagine. I thought, you
>would give perhaps one totally different point (after all, you also use very
>small TTs compared to other programs in your engine, if we can trust what we
>heard here - 32 or 64 Mb in Leiden this year).

To be precise: 30 * 2^20 byte. :-)
But I don't see how that connects to a "totally different" point.

>This first point, I don't get however. What has searching when needed to do with
>clearing of TTs?

The job of an engine is to search a position, and the result should depend only
on that position. Like the power of a car engine should depend only on its RPM,
not on how fast the car moves or how fast the car moved 1 minite ago.

Sticky TT (or reorderd piece lists :-) cause the engine to have a mind of its
own. Things with a mind of their own, like cats and (wo)men, are unreliable and
don't make a good tool.

[...]

>>5. Pondering
>>   If an engine has pondered the wrong move, the TT will be overwritten with
>>   positions that are either useless or have the wrong bound.
>
>Why should overwriting be a problem. Sure, it will be filled with a lot of
>useless info.

The useful positions will be gone.
But admittedly, even without overwriting (no pondering or unlimited TT) most of
the off-PV positions are not good enough to kick-start the next search.

... Johan




This page took 0.02 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.