Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Repeatability (questions for Omid)

Author: Omid David Tabibi

Date: 18:25:36 12/18/02

Go up one level in this thread


On December 18, 2002 at 21:19:47, Martin Giepmans wrote:

>On December 18, 2002 at 20:42:09, Omid David Tabibi wrote:
>
>>On December 18, 2002 at 20:34:58, Martin Giepmans wrote:
>>
>>><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.
>>>
>>
>>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.
>>
>>>Cheers,
>>>Martin
>
>I don't understand what you are trying to say.
>Without a research (if the verification search with reduced depth doesn't
>give a cutoff) verification search would be pointless.

The verification search goes deeper than the null-move search, so it might find
tactical errors overlooked by the null-move search, and correct them (without
any need for a re-search).


>How could research result in a "negligible" improvement?
>There is no other potential improvement ...
>
>Martin



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