Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hashing and mate score "depth"

Author: Tom Likens

Date: 17:37:00 09/09/04

Go up one level in this thread


On September 09, 2004 at 17:08:42, Michael Henderson wrote:

>When you store a mate score in the hash table, you can set the depth field to a
>very large number so that you get a cutoff whenever you reach the position again
>at any depth.  I just noticed to do this in my program today...Do you think most
>beginners miss this fact?  All the intermediate/advanced programmers probably
>have this.

Hello Michael,

One thing to be cognizant of when using this technique, is that it may prevent
your program from finding the optimal (i.e. shortest) mate in a given position.
For example, if the shortest mate in a particular position is a mate-in-6,
but your program finds a mate-in-8, it may have trouble seeing the shorter
mate because of the hash table's influence.

regards,
--tom



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.