Author: Dieter Buerssner
Date: 00:42:09 08/23/00
Go up one level in this thread
On August 22, 2000 at 21:57:58, Antonio Dieguez wrote: >can a kind person explain me Negascout? >what it does in addition of pvsing? I think there are two differences between Negascout and PVS. Both use zero window searches with -alpha-1, -alpha for the recursive call. If the score returned from the recursive call is > alpha and < beta, Negascout will research with -beta, -score while PVS will research with -beta, -alpha. Also Negascout will not research, when the depth is the final depth - 1 or the final depth - 2. I believe, this last point won't work, when you have pruning decisons in qsearch, that depend on the window (i.e. you skip capturing moves, that look, as if they could not bring back the score to alpha), or when you use futility pruning close to the leaves of the tree. Regards, Dieter
This page took 0.01 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.