Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Q: about hashing...

Author: Scott Gasch

Date: 20:12:45 07/23/99

Go up one level in this thread


>actually you only can get a 'best' move from a "LOWER" bound (fail high)
>position.  In an "UPPER" bound (fail low) all moves were bad and there is no
>'best' one.

What is the best move in a fail high condition?  Maybe I don't understand but it
seems like a fail high position is one where no successor move has beat alpha.
This is to say, alpha is the value of the best move in this position and none of
the successors beat it.  Now that I have searched this node and determined it is
a fail high, how do I store the "best" move in the hash table when there is no
best move?

It seems to me that only if the alpha < move < beta should I store a move in the
hash table...?




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.