Author: Hermano Ecuadoriano
Date: 07:57:14 02/05/01
Go up one level in this thread
On February 05, 2001 at 09:46:59, Paul wrote: >Hi! > >One last message from me on the subject, since I think I know now what made you >hesitant and wanted to share this to help clear out all the confusion forever. > >1. When a program finds a mate in *favor* of itself, so mating the opponent, >it's immediately an upper bound on the real matescore, so with more time the >announcement stays the same or gets lower (M78 ... M54 ... etc). > >2. When a program finds a mate *against* itself, so mating itself, and it stays >that way until the end of ply (when all the moves of that ply have been >examined), it's also an upper bound on the real matescore, so with more time the >announcement stays the same or gets lower (M78 ... M54 ... etc). > >Now, there are 2 interesting cases: > >1. Before the winning side finds a mate in favor of itself, it can even find a >mate against itself, but that will have disappeared by the end of the ply it >found this mate on. > >2. Before the losing side finds a mate against itself, it can have found lower >mates against itself, but again, those will have disappeared by the end of the >ply in question. > >Hope this helps a bit! > >Groetjes, >Paul I gave a clear counterexample.
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.