Author: Omid David
Date: 15:36:34 08/27/02
Go up one level in this thread
On August 27, 2002 at 17:34:35, Patrik wrote:
>int QSearch(alpha, beta)
>{
> ...............
> value = Evaluate();
> if (value > alpha) {
> if (value >= beta)
> return(value); <------------ My question
> ...............
> }
> GenerateCaptureMoves();
> ...............
>}
>
>In QSearch, if value is >= beta, it returns value without further search.
>Is this similar concept to null move in Search()?
>
>Thank you in advance.
In null-move pruning the assumption is: bestmove_score > nullmove_score
so if nullmove_score > beta then
bestmove_score > nullmove_score >= beta
so:
bestmove_score > beta
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.