Computer Chess Club Archives


Search

Terms

Messages

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

Author: Gerd Isenberg

Date: 13:10:03 11/20/02

Go up one level in this thread


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.
>
>Our experiments with verified null-move pruning show that on average, it
>constructs a smaller search tree with greater tactical strength in comparison to
>standard null-move pruning. Moreover, unlike standard null-move pruning, which
>fails badly in zugzwang positions, verified null-move pruning manages to detect
>most zugzwangs and in such cases conducts a re-search to obtain the correct
>result. In addition, verified null-move pruning is very easy to implement, and
>any standard null-move pruning program can use verified null-move pruning by
>modifying only a few lines of code.
>
>
>pdf:  http://www.cs.biu.ac.il/~davoudo/pubs/vrfd_null.pdf
>zipped pdf:  http://www.cs.biu.ac.il/~davoudo/pubs/vrfd_null.pdf.zip
>gzipped postscript:  http://www.cs.biu.ac.il/~davoudo/pubs/vrfd_null.ps.gz

Hi Omid,

Great paper, great work, interesting. Thanks for sharing.
I believe i use similar, may have a closer look. I'm not quite sure but my
control flow is a bit different. I guess the same for Vincent's double null-move
idea.

Regards,
Gerd



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