Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Neverending story with incomplete tablebases

Author: Uri Blass

Date: 10:04:05 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).
>
>This first point, I don't get however. What has searching when needed to do with
>clearing of TTs?

I think that I understand Johan.
He says that the job of the engine is to search positions and you do not need
clearing hash tables for that job.

not clearing the hash tables does not help the engine to search position that it
did not see in the past so if you have other things to do in life except the
chess engine then it is not very important thing to work about.

I also think the same.
I also may be unable to reproduce moves of movei because of different reason
that are not about hash tables.

Movei has a piece list and the order of pieces in the piece list may be
different after a search.

I can prevent that problem by calculating order of pieces that is based only on
the FEN in the root but I did not do it until today.

Uri



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.