Computer Chess Club Archives

Search

Messages

Subject: Re: Egtb mates and

Author: Dieter Buerssner

Date: 05:27:24 02/04/01

Go up one level in this thread

On February 02, 2001 at 21:10:54, Paul wrote:

[I wrote something wrong]
>>I think, especially with EGTB mates, it is quite possible
>>that it is not an upper limit, and that with higher depth the opponent may
>>by able to find a refutation, that delays the mate.

...

>Is there a difference according to you between 'normal' mates found by a search
>without using EGTB's, and mates found by a search that is using EGTB's? If so,
>what? And if not, then normal non-EGTB-search-mates are not an upper bound?

The above was obviously wrong, and I was seriously confused - sorry. After
thinking another while about this, I have no idea anymore, how I came to the
idea above ...

As also confirmed by Robert Hyatt, the mate score should allways be exact
or an upper bound.

Regards,
Dieter

• Re: Egtb mates and upper bounds Paul 06:46:59 02/05/01
  • Re: Egtb mates and upper bounds Hermano Ecuadoriano 07:57:14 02/05/01
    • Re: Egtb mates and upper bounds Hermano Ecuadoriano 08:28:28 02/05/01
      • Re: Egtb mates and upper bounds Paul 08:32:55 02/05/01
    • Re: Egtb mates and upper bounds Paul 08:10:02 02/05/01
• Re: Egtb mates and Hermano Ecuadoriano 08:48:44 02/04/01
  • Re: Egtb mates and Paul 11:06:15 02/04/01
• Re: Egtb mates and Paul 06:07:30 02/04/01

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.