5
$\begingroup$

I have a very unique chess construction task for you all today: Build me a pawn wall!

I challenge you to construct a game that ends with both sides having 6 pawns on a file. This means that 6 white pawns on alligned on one file and 6 black pawns on another.

Before you call this an impossible task, I will let you know that I have found it myself to be possible for I have proven it possible already.

$\endgroup$
  • 8
    $\begingroup$ Bonus points if you get the other side to pay for it. $\endgroup$ – jafe Apr 10 at 11:39
  • $\begingroup$ Not really. They are both paying the other to make a wall for them! $\endgroup$ – Rewan Demontay Apr 10 at 11:42
  • $\begingroup$ @jafe Hahahahaha omg i'm dying $\endgroup$ – North Apr 19 at 1:53
5
$\begingroup$

I've managed to reduce it to 34 moves.
I can't prove this is optimal but I can't seem to get any lower using this strategy.

1. a4 h5
2. g4 b5
3. axb5 hxg4
4. Nf3 Nc6
5. bxc6 gxf3
6. Nc3 Nf6
7. Ne4 Nd5
8. Nf6+ exf6
9. Bh3 Nc3
10. dxc3 Ba6
11. Be6 Bd3
12. exd3 dxe6
13. Ra5 Rh4
14. Rf5 Rc4
15. dxc4 exf5
16. h4 a5
17. h5 a4
18. h6 a3
19. h7 a2
20. h8=Q a1=Q
21. Bf4 Qa5
22. Qh4 Bc5
23. Qd6 cxd6
24. Be5 Be3
25. fxe3 dxe5
26. Qf4 Qc5
27. b4 g5
28. bxc5 gxf4
29. e4 Qd5
30. exd5 e4
31. Rf1 Rc8
32. d6 e3
33. Rf2 Rc7
34. dxc7 exf2+ *

Apronus link

Chess game, as above

$\endgroup$
  • $\begingroup$ Now you gotta find the fastest way you can to do this! $\endgroup$ – Rewan Demontay Apr 10 at 13:47
  • $\begingroup$ Yello? You there hexomino? $\endgroup$ – Rewan Demontay Apr 10 at 21:55
  • $\begingroup$ @RewanDemontay Finding the fastest is certainly a challenge. I could probably get my current tally down a few moves but couldn't be sure when it would be the best. Do you know the fastest way? $\endgroup$ – hexomino Apr 10 at 22:39
  • $\begingroup$ Hell yes I know the fastest way! I found it myself. But the puzzle is about what YOU can find. $\endgroup$ – Rewan Demontay Apr 10 at 22:42
  • $\begingroup$ You don’t nessacarily have to however. $\endgroup$ – Rewan Demontay Apr 11 at 11:43
1
$\begingroup$

I did a quick sweep of the chess.com forums, and found a sweet, optimal 31.5 mover.

Credit goes to our very own Remellion here on SE for finding this solution! https://www.chess.com/forum/view/general/how-many-distinct-chess-games-are-possible-and-which-is-the-longest?page=7

1. b4 g5 2. h4 a5 3. hxg5 axb4 4. c4 f5 5. Rh4 Ra3 6. Re4 Re3 7. dxe3 fxe4 8. Nc3 Nf6 9. gxf6 Bh6 10. a4 Bf4 11. a5 h5 12. a6 h4 13. a7 h3 14. a8=Q b5 15. Ra6 h2 16. Rd6 exd6 17. Qc6 dxc6 18. exf4 h1=Q 19. g4 Qf3 20. exf3 Rh7 21. Be3 Rf7 22. Bc5 dxc5 23. Qc2 bxc3 24. Ne2 Qd5 25. cxd5 Bf5 26. Nc1 Nd7 27. Bc4 Nf8 28. Nd3 Ne6 29. gxf5 exd3 30. dxe6 dxc2 31. Ke2 bxc4 32. exf7+

$\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.