Author: Robert Hyatt
Date: 07:24:30 12/27/99
Go up one level in this thread
On December 27, 1999 at 05:14:47, Edward Heddle wrote: >I'm new here. I am not actually involved in programming, but more the theory of >programming. > >My question is; how do null move reductions work; i.e, at what points in the >search tree are null moves tried? > >Thanks > >Ed ;) Everywhere. Any position where you can let your opponent move twice in a row, and you still fail high, is obviously a very good position for you (or a very bad one for him.)
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.