Author: Ulrich Tuerke
Date: 13:40:52 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 Recursive nullmove means that the subtree below a nullmove will again be searched using nullmoves, i.e. you can have more than 1 nullmove in a line which you are searching. The "standard-wisdom" is however that you have to avoid adjacent nullmoves. In contrast to this, in the non-recursive nullmove search, the nullmove appears at most once in a line. Uli
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.