Author: Peter Fendrich
Date: 16:28:36 07/01/03
Go up one level in this thread
On July 01, 2003 at 18:37:19, Russell Reagan wrote: >On July 01, 2003 at 18:34:40, Uri Blass wrote: > >>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. > >I know they work differently, but I wonder if they give similar results by >different approaches. If the evaluation used to prove a FHR is a null move search then we have quite similar results. /Peter
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.