Computer Chess Club Archives




Subject: Re: Verified Null-Move Pruning, ICGA 25(3)

Author: Uri Blass

Date: 11:47:44 11/20/02

Go up one level in this thread

On November 20, 2002 at 14:29:52, Miguel A. Ballicora wrote:

>On November 20, 2002 at 11:43:10, Omid David Tabibi wrote:
>>            ICGA Journal, Vol. 25, No. 3, pp. 153-161, September 2003
>>                          Verified Null-Move Pruning
>>                    Omid David Tabibi and Nathan S. Netanyahu
>>                                   Abstract
>>In this article we review standard null-move pruning and introduce our extended
>>version of it, which we call verified null-move pruning. In verified null-move
>>pruning, whenever the shallow null-move search indicates a fail-high, instead of
>>cutting off the search from the current node, the search is continued with
>>reduced depth.
>Nobody thought about this before? Never published? I cannot say that I am going
>to try it because... I've been doing this with Gaviota since the beginning :-).
>It looked logical to me. It avoids most of the problems with zugzwangs IMO. Nice
>to see a proof that it is worth it, though. It is very similar, IMHO, to what
>some other people do, which is try at reduced depth (first) to see if the
>nullmove search is worth doing it. I think that YACE does that from Dieter's
>comment. I believe that YACE's approach is better but I never bothered to check.
>Thanks for the paper, I have problems downloading the pdf, I will try later the
>other files.

The main value of the idea is not in avoiding zugzwangs but to find tactics

I believe that Yace does different algorithm because Dieter did not tell about
big tactical improvement.


This page took 0 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.