Computer Chess Club Archives




Subject: Re: Null move reductions

Author: Will Singleton

Date: 11:26:15 10/05/98

Go up one level in this thread

On October 04, 1998 at 21:21:09, Roberto Waldteufel wrote:

>Yes, I have noticed more improvement when one move is clearly best than when
>there are many plausible candidates, but I had put that down to the nature of
>the null move! If there are many plausible moves, then that leaves fewer
>terrible moves to cause null-move cutoffs on the next ply. Do you find the same
>effect with R=1 as with R=2? I suspect that nodes with a clearly best move are
>just plain easier to handle than the rest.
>Best wishes,

I have have bad luck with R=1, causes things to go weird, something to do with
my search algorithm.  So I can only use R=2.


This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.