Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Clearing the hashtables before the search

Author: Thomas Mayer

Date: 08:48:33 12/30/01

Go up one level in this thread


Hi Gian-Carlo,

On December 30, 2001 at 08:43:58, Gian-Carlo Pascutto wrote:

>>When I get a tablebasehit, I update the age-counter of that entry to current
>>age-counter to prevent that to much is overwritten in the primary table.
>
>I presume you mean transposition table hit?

sure... mistype... :)

>Basically you prevent the entries you have used from being
>replaced. Sounds like a good idea, but I wonder about
>the effect of not having any move ordering info for the
>rest of the tree.

think about iterative deepening ! You have move ordering for the rest of the
tree ! Because most important entries from last search with old age will be
marked with the new age because of iterative deepening... At least in most cases
the main variants for all moves...

Another I get from Jochen Peussner, instead of just keeping the PV in a several
table you could also save the main variant which leads to the last cutoff in a
table... so far I have not experimented with it, but I will do in future... it
is not of big interest for blitz games, but with high depth this could be
interesting.

Greets, Thomas



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.