Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Aspiration search

Author: Robert Hyatt

Date: 14:13:55 08/13/99

Go up one level in this thread


On August 13, 1999 at 02:19:30, Scott Gasch wrote:

>Hey,
>
>I have a (stupid?) question about aspiration search.  I understand the concept
>is to atrificially limit the search window in an effort to prune faster.
>However, a value returned from Search(pos, a, b) will always be within the a-b
>window.  I.e. a <= value <= b.  How, then, does one tell if the value returned
>is bogus and needs to be re-Searched or whether it is good?  Which does a value
>== a or value == b mean?
>
>Thanks,
>Scott


Simple... the value returned must be > alpha _and_ < beta to be useful.  If it
is >= beta, re-search with a bigger beta.  If it is <= alpha, re-search with a
lower alpha.



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.