Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hash replacement question

Author: David Eppstein

Date: 13:35:10 01/15/98

Go up one level in this thread


On January 15, 1998 at 07:19:48, Amir Ban wrote:
> Often when you evaluate a node, you have a situation where you can
> record a bigger depth in the hash entry, but the eval info is less
> exact. What do you do in this case ?

It is pretty common (because of iterated deepening) for my program to
get hash hits that are too shallow, but rare for it to get hits that are
unusable because they're insufficiently exact. So I store the value with
the bigger depth.



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.