e5 cannot occur in one move, because… let me show you.
What about that one (another solution with e7-e5):
e5 cannot occur in one move, because… let me show you.
What about that one (another solution with e7-e5):
e5 cannot occur in one move, because… let me show you.
What about that one (another solution with e7-e5):
god. damnit.
alright, alright, fine. there are now two solutions.
Still suboptimal, I believe. 18 is a theoretical lower bound (4 moves per each bishop, 3 moves per each knight, 4 pawn moves) but I don't know whether it is attained.
Here’s another shortest proof game with just one solution, this time after black’s 4th move.
I did a bit more fooling around on the analysis board, and… for Christ’s sake, I made another one with two solutions!
Another proof game:
White to move, after 8th black's move. How did the game go? (multiple solutions)
You found one, but there’s another!
And another!
ah… I was thinking of
It is white to move
Whoever finds the fastest proof game wins
First try, probably suboptimal:
Second try: