Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Repeatability (questions for Omid)

Author: Martin Giepmans

Date: 17:34:58 12/18/02

Go up one level in this thread


<snip>
>The tactical strength is not affected by the re-searches. They merely help >avoid
>zugzwangs.

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.

Cheers,
Martin




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