Author: Ernst A. Heinz
Date: 12:30:30 03/05/01
Go up one level in this thread
Hi Severi, >I really would like to know it...pretty please. The original "Scout" and "NegaScout" algorithms consist of _two_ separate functions that call each other recursively. Their effect is the same as that of a standard PVS search. Moreover, Reinefeld discovered that for _fixed-depth_ searches (in the strict theoretical sense of the word, i.e., uniform path lengths from the root to _all_ leaf nodes) researches after fail-highs of minimal-window searches are superfluous if the remaining depth at the node in question is <= 2 plies. The discovery was initially made and published in the "Scout / NegaScout" rather than the PVS framework. Reinefeld's discovery is of no practical importance, however, as soon as you look at variable-depth searches as caused by extensions and forward-pruning. =Ernst=
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.