Author: Christoph Fieberg
Date: 11:33:12 07/11/01
Go up one level in this thread
On July 11, 2001 at 12:22:15, Heiner Marxen wrote: >On July 11, 2001 at 11:45:17, Christoph Fieberg wrote: > >>I composed the following position: >>[D]r2qk2r/8/8/qqqqqqqq/QQQQQQQQ/8/8/R2QK2R b KQkq - 0 80 >> >>Who can construct a game to reach it? >> >>In my first attempt I needed 161 moves (last move was 81.Ke1). 161 moves was meant as half-moves! (as you could see from the notion 81.Ke1) Sorry, that I did not express excatly. > >If the white K has moved, its castling rights KQ should be removed! > In my game both kings had moved! Therefore no castling possible any more. >>Who needs less moves? > >IIRC, Popeye can construct proof games. But more than 300 plies? As explained only 161 plies are necessary! Can Popeye cope with it? Regards, Christoph >I cannot imagine any program to proove the shortest proof game for such >a position... but then, what do I know? > >>Best regards, >>Christoph > >Regards, >Heiner
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.