Author: Robert Hyatt
Date: 20:35:08 04/27/01
Go up one level in this thread
On April 27, 2001 at 13:07:49, Miguel A. Ballicora wrote: >I see that in other threads people are talking about "recursive" nullmove >as a breakthrough. I think I understood what nullmove is and I implemented it >in my program. But... what makes it "recursive"? What is that exactly? >What's the difference with a non-recursive implementation? >Is non recursive an implemenation that does not allow two nullmoves in the same >search path? If it is so, why there is such a big improvement over the >"non-recursive"? > >Thanks, >Miguel The _original_ use was a single null-move in any path. That was called "non-recursive". "recursive" allows any number in a single path, only it disallows two consecutive null-moves...
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.