Computer Chess Club Archives

Search

Messages

Subject: Re: Clearing the hashtables before the search

Author: Thomas Mayer

Date: 05:28:35 12/30/01

Go up one level in this thread

Hi Gian-Carlo,

>My problem is, is it 'ok' to have old hash entries
>lying around in the depth priority table?

yes, but you need kind an aging system. I do the following: Each new start of a
search I increase a age-counter.

When it's time to decide if an entry in the priority table should be
overwritten, I compare the age in the entry with current age-counter... If it is
the same, depth and some other things decide whether to overwrite or not. If it
not the same, I overwrite the entry and put the old entry in the other table.

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.

Greets, Thomas

• Re: Clearing the hashtables before the search Gian-Carlo Pascutto 05:43:58 12/30/01
  • Re: Clearing the hashtables before the search Thomas Mayer 08:48:33 12/30/01
  • Re: Clearing the hashtables before the search Miguel A. Ballicora 06:42:36 12/30/01

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.