Author: Paul
Date: 06:07:30 02/04/01
Go up one level in this thread
On February 04, 2001 at 08:27:24, Dieter Buerssner wrote: >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. Ok, thanks Dieter ... and I'm sorry I confused you, I have that effect on people sometimes. :) Let's agree that this is the last time that we apologize to each other, ok ;?) See ya, Paul
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.