Computer Chess Club Archives

Search

Terms

Messages

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

Author: Omid David Tabibi

Date: 13:21:00 11/26/02

Go up one level in this thread

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

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