13
$\begingroup$

For this puzzle, I tried my hand at a type of structure similar to those appearing in a few of Dmitri Baibikov's (brilliant!) puzzles. It took a lot of fiddling to finally get this working, but I'm really happy with the result:

Can you determine the last 20 single moves that led to this position?

Final position, FEN is N7/Ppp5/rpp5/k7/B7/KPP2p2/pPP3P1/N7

As always, please provide your reasoning and a proof game in your answer. Have fun! :)


Note: Due to a small oversight, only the last nineteen single moves are uniquely determined here (as pointed out by Элси Ринген in the comments).

$\endgroup$
5
  • 2
    $\begingroup$ By "20 single moves" you mean 20 ply moves, i.e. 10 moves from each player? $\endgroup$
    – msh210
    Commented Jun 6 at 9:29
  • 2
    $\begingroup$ @msh210 Yes, exactly. (But in addition to a ply, a "single move" also asks for the precise position before the ply, which is a bit more information) $\endgroup$ Commented Jun 6 at 9:37
  • 1
    $\begingroup$ It's all good. However, there are 19 moves, not 20. Instead of 10. ... Kc5-b5, is possible 10. ... a7xBb6 11. Be3-b6 Kc5-b5 12. Bh6-e3+ $\endgroup$ Commented Jul 13 at 22:27
  • $\begingroup$ Maybe so: 10. ... a7xNb6. $\endgroup$ Commented Jul 13 at 22:53
  • $\begingroup$ @ЭлсиРинген Ah, that's true. Not sure how I missed that, thanks for catching this $\endgroup$ Commented Jul 14 at 11:30

1 Answer 1

6
$\begingroup$

Solution

The last 20 moves are:

(White retracts first) Bb5-a4 f4-f3 Bc4-b5 f5-f4 Bg8-c4 f6-f5 g7-g8=B f7-f6 f6xNg7 Ne6-g7 f5-f6 Nc5-e6 f4-f5 Na4-c5 f3-f4 Kb5-a5 f2-f3 Ra5-a6 a6-a7 Kc5-b5

You can see the proof game on Lichess here, or paste the position N7/Ppp5/rpp5/k7/B7/KPP2p2/pPP3P1/N7 and the solution into Retractor 2.

Reasoning

  1. The crucial problem is that Black will run out of moves to retract before it is forced to retract Kb5-a5, which will expose an illegal check by the Rook.
  2. We desperately need White to un-capture a Black piece, but we cannot do it with dxc2. To see this, we do a tally.
  3. Black is missing 8 things
  4. White is missing 6 things.
  5. White does at least 6 captures: axb3, dxc3, and e2 x ... x a6.
  6. Black does at least 6 captures: axb6, dxc6, and e7 x ... x a3. By (4) and (6), we see that White's c1 bishop cannot die on its home square. This proves (2).

How can we retract? The only other way is to un-capture a Black piece (who will block the check) with the Bishop at a4 being a promoted Bishop. Assuming no wasted time, this fixes (White retracts first) Bb5-a4 f4-f3 Bc4-b5 f5-f4 Bg8-c4 f6-f5. (We will justify this assumption later)

  1. Black is missing 2 pawns (the g and h pawns)
  2. White is missing 2 pawns (the f and h pawns)
  3. Because of (4), (6), and (8), we see that white's f and h pawns must have promoted.
  4. Because of (7), (9), and the pawn on f3, there must be at least two more captures by White to clear the paths for the White f and h pawns. In particular, no Black piece can die on their home square.
  5. Because of (3), (7), (10), and the pawn on f3, we see that the only way to proceed is the following scheme:
    1. White f takes something and promotes.
    2. White h x g (to promote), clearing a path for Black h pawn to promote.
  6. Because of (11.2), we cannot have White h7xg8=B, nor can we have White h6xg7 because we haven't nearly retracted Black's promoted h pawn back to h2 yet. So we fix 2 more moves g7-g8=B f7-f6.
  7. Now White is running out of moves to retract. Because of (10), Black cannot retract dxc6 to un-capture a White piece. So Black must rush (by retracting moves) to Block the check at a4. The only way to not run out of time and not give an illegal check is f6xNg7 Ne6-g7 f5-f6 Nc5-e6 f4-f5 Na4-c5, fixing 6 more moves.
  8. Six more moves f3-f4 Kb5-a5 f2-f3 Ra5-a6 a6-a7 Kc5-b5 are absolutely forced as White barely has enough moves to retract. This justifies the earlier assumption of "no wasted time".

Comments

This is a beautiful puzzle. When d7xc6 was ruled out, it seemed hopeless. This is my first retro puzzle where I have to fully "think in reverse", in terms of un-capturing and un-promotions. Eventually the only possible line came out. Thank you for the puzzle!

Retractor 2 helped me play the position in reverse (it cannot solve such a hard position). Check my edit history (1st version) for a proof game in reverse to play on that site.

It helped me to know that if less than the target number of moves (20) were forced, then it was not the solution. (So a fiendish setter might simply say "Prove or disprove this position".)

Did I see a similar position somewhere on Retro Corner? It must have been years ago.

$\endgroup$
1
  • 2
    $\begingroup$ Very good solution, thanks a lot for putting in the effort! I don't know much about the Retro Corner, but the short article "Length records in 'Last single moves?' problems" (by Baibikov, Brobecker & Le Gleuher) contains the four positions A15, A16, A19 and A20 with a similar structure to this one. (Incidentally, A16 might just be my favourite retro puzzle overall, so I can highly recommend checking these out.) $\endgroup$ Commented Jun 7 at 9:37

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.