Author: Dave Gomboc
Date: 01:59:28 09/09/01
Go up one level in this thread
On September 09, 2001 at 04:16:26, Gian-Carlo Pascutto wrote: >On September 08, 2001 at 23:54:22, Dave Gomboc wrote: > >>Does it actually win a piece? I seem to recall Amir Ban investigating this >>position and posting that no piece can be won. I assume he did a fairly >>thorough job of playing through various variations, i.e. I don't think he just >>set his program on infinite time and let it run. >> >>I don't have a CCC archive set up, maybe somebody else can find his comments. >> >>I am not saying that a piece cannot be won, I'm just not sure what the truth is. >> It would be helpful if we had the PV from the DT2 search. > >Nobody (except DT) found the way to actually win a piece. That >doesn't mean there isn't any. > >-- >GCP Right, but because only one program found it, it doesn't mean that there _is_ a way either. DT/DB has had bugs before, e.g. when DB2 tossed a rook against Kasparov in the ending of the first game, and Kasparov & co. ended up thinking that it had seen everything to the end. Actually, there was actually a C macro expansion error in their source code, which IIRC they didn't actually find until after game 2. True, the chance of the +2.xx score being caused by a bug may be low... but let's face it, the DT/DB team were always scrambling to get everything ready in time for the big match. So what is the way to win the piece? (What is the PV?) Dave
This page took 0.03 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.