Author: Miguel A. Ballicora
Date: 10:07:49 04/27/01
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
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.