Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hash Table Collisions

Author: Tom Kerrigan

Date: 19:59:22 04/12/00

Go up one level in this thread


In my experience, here's what happens:

You search the initial position to 10 ply and play e4.

Because of that search, there is a "9 ply" hash table entry for the resulting
position.

So when you start the next search, you do a 1 ply search(). It finds the hash
table entry, sees that 9 > 1, and returns immediately. Then you do a 2 ply
search(), same thing happens. Until you do a 9 ply search.

So it's not necessary to keep track of which entries are still "good" because
you start the search up again where you left off.

-Tom



This page took 0.01 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.