Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nullmove verification search

Author: Colin Frayn

Date: 03:22:07 07/26/02

Go up one level in this thread


On July 25, 2002 at 18:26:40, Scott Gasch wrote:

>My question for other programmers around is: is there anyone else playing with
>this null verification search and how are your results / impressions?

I'm using it in Beowulf, though I'm retaining some of the preliminary checking
stuff (i.e. don't try nullmove at all if there is virtually no material, if
there is a check on the board or if we're on the first two plies.)  I'm also
experimenting with double null move - that is do up to two null moves in a row
on successive plies.  That seems to help slightly too.

I spent AGES on null move because it just messed up the search so much
initially.  I'm using adaptive depth search at the moment depending on the
current ply and board position.  Usually between R=2 and R=3.

Cheers,
Col



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.