Computer Chess Club Archives


Search

Terms

Messages

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

Author: Omid David Tabibi

Date: 09:29:19 11/20/02

Go up one level in this thread


On November 20, 2002 at 11:52:49, Gian-Carlo Pascutto wrote:

>My very first thought after looking through this was:
>
>'You note that Heinz R=2/3 appears to be superior to
>R=2 and R=3, but you don't include it in the comparison.'
>

Heinz reported the 10%-30% reductiong in tree size on DarkThought. This figure
will vary from program to program. In Genesis, verified algorithm constructed a
smaller tree than the adaptive one. Moreover, while the adaptive method strives
to reach the same tactical strength as standard R = 2, the presented verified
algorithm has greater average tactical strength than standard R = 2.

Omid.

>--
>GCP



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