Computer Chess Club Archives


Search

Terms

Messages

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

Author: Robert Hyatt

Date: 17:02:06 11/26/02

Go up one level in this thread


On November 26, 2002 at 16:21:00, Omid David Tabibi wrote:

>On November 26, 2002 at 15:58:06, Gian-Carlo Pascutto wrote:
>
>>On November 26, 2002 at 15:55:56, Omid David Tabibi wrote:
>>
>>>So it is reasonable that on every program starting from a certain depth >adaptive null-move pruning will always construct a smaller search tree.
>>
>>Don't you mean the other way around?
>>
>
>Yes :-)
>
>Starting from a certain depth, verified null-move pruning will always construct
>a smaller search tree than the adaptive one.
>
>
>
>>--
>>GCP


 I am doing some testing now.  First thing I noticed is that for WAC, the
time-squared
measurement went down very significantly for your algorithm.  And I have not
modified
anything such as turning null-move off when low material happens, since your
idea will
catch the zug problems.

I am playing a match between old and new, and at the moment the result is

5 wins, 2 losses, 13 draws, new version is ahead.  Not enough games, but it is
interesting...

More as I get more info...




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