Computer Chess Club Archives

Search

Messages

Subject: Re: Repeatability (questions for Omid)

Author: Martin Giepmans

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

Go up one level in this thread

<snip>
>>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?

Martin

• Re: Repeatability (questions for Omid) Omid David Tabibi 18:51:20 12/18/02
  • Re: Repeatability (questions for Omid) Martin Giepmans 19:19:24 12/18/02
    • Re: Repeatability (questions for Omid) Uri Blass 22:46:01 12/18/02
      • Re: Repeatability (questions for Omid) Dan Andersson 05:56:45 12/19/02
        • Re: Repeatability (questions for Omid) Gian-Carlo Pascutto 06:39:54 12/20/02
          • Re: Repeatability (questions for Omid) Vincent Diepeveen 15:59:41 12/20/02
            • Re: Repeatability (questions for Omid) Dan Andersson 16:27:29 12/20/02
      • Re: Repeatability (questions for Omid) Martin Giepmans 05:47:02 12/19/02
        • Re: Repeatability (questions for Omid) Uri Blass 05:57:50 12/19/02
          • Re: Repeatability (questions for Omid) Martin Giepmans 06:32:40 12/19/02
            • Re: Repeatability (questions for Omid) Uri Blass 06:49:00 12/19/02
              • Re: Repeatability (questions for Omid) Martin Giepmans 07:40:43 12/19/02

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