8
$\begingroup$

Is it possible to set up a legal chess position with all 32 pieces on the board, where there can be a string of unbroken captures such that only the kings are on the board when it is over?

You can see an attempt I made here. In the resulting position (after 13. .. Qxg4), the puzzle would be solved if not for the fact that white's capture of the rook with the queen was check, which unfortunately forces black to recapture. This means that if we could switch the places of the white (black) queen with the white (black) rook in the starting position, the puzzle would be solved. The problem is that that position is not legal, as the rook has no way of jumping over the pawn chain.

Perhaps this can be done easier with knights capturing everything?

PS. I hope this is an appropriate question here. If not, please let me know what to do to improve it. Also, if you have tag suggestions, please do share.

$\endgroup$
  • $\begingroup$ What makes swapping the rooks and queens an invalid starting position? Couldn't they just go around the pawns when one has moved 2 spaces forward and an adjacent one is unmoved? $\endgroup$ – Apep Aug 26 '17 at 11:41
  • $\begingroup$ @Apep Hm, you probably right, dunno why I overlooked that. I'd accept that answer. Thanks. $\endgroup$ – Bobson Dugnutt Aug 26 '17 at 12:04
  • $\begingroup$ Flagging as too broad, many answers could be right, as far as i can see $\endgroup$ – TrojanByAccident Aug 26 '17 at 22:17
  • $\begingroup$ @TrojanByAccident Is it a requirement that there is only one answer? $\endgroup$ – Bobson Dugnutt Aug 27 '17 at 8:49
  • 1
    $\begingroup$ @TrojanByAccident There is actually one answer, yes or no. There may be many examples that prove yes, but there needs be only one provided. $\endgroup$ – micsthepick Sep 5 '17 at 1:22
3
$\begingroup$

Just to close the books on this one, here is a solution, which was created by swapping the queens and rooks (as suggested by @Apep). Since the rook doesn't move as freely as the queen, some minor asymmetries had to be introduced.

I checked that the initial position is indeed reachable within the rules of chess.

By the way, if anyone has a more elegant solution, please do share.

$\endgroup$
3
$\begingroup$

Well, if you want the fastest possible (as in fastest from the starting position) string of unbroken captures, then you can do it just 17 moves, starting on move 3. I asked the same question on CSE, and this is a modified version if the answer to it. (It has 29/30 pieces captured. This has 30.)

Enjoy this elegant solution!

enter image description here

PGN: 1. d3 d6 2. Bg5 Bg4 3. Bxe7 Bxe2 4. Bxd6 Bxf1 5. Bxc7 Qxd3 6. Bxb8 Qxc2 7. Bxa7 Rxa7 8. Qxc2 Rxa2 9. Qxh7 Rxb2 10. Qxg8 Rxb1+ 11. Rxb1 Rxh2 12. Rxb7 Rxh113. Rxf7 Rxg1 14. Rxg7 Rxg2 15. Qxf8+ Kxf8 16. Kxf1 Rxf2+17. Kxf2 Kxg7

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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