Author: Bas Hamstra
Date: 01:15:21 12/28/99
Go up one level in this thread
On December 27, 1999 at 10:24:30, Robert Hyatt wrote: >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.) Still it is strange that this worked bad at shallow depths. That same kind of errors must still be in the nullmove tree. If I am still not entirely convinced that with nullmove is always better. If I let my engine play GNU for example with R=2 and with nullmove off, it doesn't seem to make a big difference at blitz.
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.