Computer Chess Club Archives


Search

Terms

Messages

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

Author: Gian-Carlo Pascutto

Date: 12:58:06 11/26/02

Go up one level in this thread


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?

--
GCP



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