Computer Chess Club Archives

Search

Terms

Messages

Subject: Programming question: why clearing the hash tables?

Author: José Carlos

Date: 15:49:16 08/24/00

  In Averno, I never clear the hash tables. I store the total material (sum of
both sides) with the position, flags and move. So, when I'm going to store a new
posotion, I check if the material stored is bigger than the material at the root
of this search. In that case, I replace always. Otherwise, if the other tests
point me to store the position, I save the actual material (in that node of the
tree) with the position.
  I know this could not be accurate when promoting occurs, but works fine most
of the time.
  Just curious, why do you guys clear the hash tables and when? I read here some
days ago that Christophe clears before every search in Tiger, but is not going
to do it in further versions. Can you reveal your secret? :)

  Thanks in advance.

  José C.

Re: Programming question: why clearing the hash tables? Robert Hyatt 18:06:57 08/24/00
Re: Programming question: why clearing the hash tables? Dave Gomboc 16:53:46 08/24/00

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.