Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Search Instabilities

Author: Gian-Carlo Pascutto

Date: 08:14:55 01/21/02

Go up one level in this thread


On January 21, 2002 at 10:55:50, Daniel Clausen wrote:

>Anyone has a trivial example at hand which demonstrates this behaviour?

Sjeng will print out false-fail-highs, and it happens in quite a bit
of positions.

>Why is it that a fail-high with a zero window can't be trusted but a fail-high
>with a non-zero window can? Is "non-zero window" enough to be trusted? Or does
>it have to be a certain minimum window? I'm sure that as soon as someone posts >a mini-example which shows this behaviour, even I will understand it. :)

Generally, if you fail-high another time on the research with a different
window, the fail-high will be a sound one. But not _always_ in my experience.

--
GCP



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.