Computer Chess Club Archives




Subject: Re: Repeatability (questions for Omid)

Author: Martin Giepmans

Date: 18:44:09 12/18/02

Go up one level in this thread

>>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).

No need for a research ??????????
It's late, I guess we are talking about two different things?


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