Originally posted by RopespierreI must admit I find it rather unreasonable that you expect me to sit down with a chess board and work out the 500 gazillion positions that could be reached in 23 moves. π
I must admit I find it rather unreasonable that you expect me to sit down with a chess board and work out the 500 gazillion positions that could be reached in 23 moves. π
I don't really know how to go about solving such a problem.
Here's another one for us mortals:
White to move and win.
[fen]8/8/1KP5/3r4/8/8/8/k7[/fen]
Agreed - I would expect you to use logic and reason instead. π΅
Mine is not very original or new...
mitrofanov's incredible study (in fact it's corrected version, originally the knight was on f3 instead of g2), one of the most famous ever published...with a stunning move at move 7 !
more details about it here : http://www.xs4all.nl/~timkr/chess2/mitrofanov.htm
(don't go there if you want to find it alone...in what case i wish you good luck!)
Originally posted by RopespierreNo, there is no foul play. The position must be produced by playing a legal game of chess. The main weird thing about Proof Games is that White and Black aren't opposing one another.
alright, I'll give it your puzzle a try. But before I do, does it involve any "foul play"?
In other words, something that most of us wouldn't consider legal?
The cool thing is that there is only ONE sequence of moves that will produce the desired end position in the time allotted.