Computer Chess Club Archives




Subject: Re: Repeatability (questions for Omid)

Author: Omid David Tabibi

Date: 17:42:09 12/18/02

Go up one level in this thread

On December 18, 2002 at 20:34:58, Martin Giepmans wrote:

>>The tactical strength is not affected by the re-searches. They merely help >avoid
>This is not true, Omid.
>Nullmove pruning often overlooks tactical (and positional) threats
>that are not related to zugzwang. Because of that some programmers use
>(standard) verification search in every phase of the game.

The major improvement comes from the continued search after a fail-high report,
which detects tactical errors beyond the horizon of the original null-move
search. Re-searches can also contribute to enhancing the middlegame tactical
performance, but that additional improvement is usually negligible.


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