Computer Chess Club Archives

Search

Messages

Subject: Clearing the hashtables before the search

Author: Gian-Carlo Pascutto

Date: 05:14:14 12/30/01

Hi all,

I'm wondering about the following:

before searching, right now, I always clear my
depth-priority hashtable (I have 2 tables, depth-prior
and always-replace). However, that takes some time,
which gets significant with huge hashtables, and I
will be getting rid of it via aging.

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

When doing this, and the move of the opponent is what
was in my PV, the search immediately will zoom up to
the depth it had reached. This is nice, but I am wondering
about the implications for iterative deepening. It seems
to me that this could actually be slower because it now
has to start a very deep search with nearly no move
ordering info.

Has anyone tested this? What are you doing?

--
GCP

• Re: Clearing the hashtables before the search José Carlos 06:44:41 12/30/01
  • Re: Clearing the hashtables before the search Gian-Carlo Pascutto 06:50:57 12/30/01
    • Re: Clearing the hashtables before the search José Carlos 07:12:49 12/30/01
      • Re: Clearing the hashtables before the search Gian-Carlo Pascutto 07:19:59 12/30/01
        • Re: Clearing the hashtables before the search José Carlos 07:51:28 12/30/01
• Re: Clearing the hashtables before the search Thomas Mayer 05:28:35 12/30/01
  • 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.