Author: Uri Blass
Date: 15:34:40 07/01/03
Go up one level in this thread
On July 01, 2003 at 18:28:25, Russell Reagan wrote: >On July 01, 2003 at 18:24:43, Omid David Tabibi wrote: > >>... which is called verified null-mvoe pruning :) > >So if fail high reductions is kind of like null-move without the "radicalness", >and verified null-move pruning takes the "radicallness" out of null-move, do >fail high reductions and verified null-move give similar results? :) No Verified null move pruning is different. verified null move does not reduce the depth by 1 in every node but only in part of them and the reduction is not based on static evaluation. Uri
This page took 0.01 seconds to execute
Last modified: Thu, 07 Jul 11 08:48:38 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.