Author: Uri Blass
Date: 22:41:18 10/18/05
Go up one level in this thread
On October 19, 2005 at 00:20:10, Yakov Konoval wrote: >On October 18, 2005 at 11:04:13, GuyHaworth wrote: > >> >>The question of the deepest 'Mate in N' Chess Problem must be answered in Jeremy >>Morse's book on 'Chess Records' which I regret I do not have. >> >>I think I've seen Chess Problems 'N' > 100, maybe > 200. >> > >There are mate in 267,272,292 (illegal position) chess problems. The question is also if it can be proved in these problems that there is no shorter mate. Note that it may be possible to prove it if a computer proves that the oppoent has at least forced draw or repetition after every alternative to the solution. I think that no known problem can compete with KRRN vs KRR that is probably longer mate[the distance to mate is not known exactly and only distance to zeroing move(conversion or pawn move) but it is possible to calculate also distance to mate] Uri
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.