Author: Peter McKenzie
Date: 15:22:53 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()?
Yes, it is a similar concept. Both are based on the assumption that having the
move is usually an advantage.
Standing pat in QSearch is based on the assumption that there is usually a move
that is at least as good as just doing nothing. Therefore if staticScore >=
beta, the odds are that there exists a move in the position which will keep the
score >= beta too.
Nullmove pruning is based on the assumption that having 2 moves in a row is
usually a huge advantage. This is not quite the same assumption, but it is
closely related.
cheers,
Peter
>
>Thank you in advance.
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.