Shortest-proof-game challenge

Well, I was going to post a solution, but the problem keeps changing before I can.

So I'll move on instead.

That's my bad; I extended it.

This was a fun proof game to solve. 13.0

Unique SPG in 9.0.

SPGs in 14.0.

Is there a name for this idea where the knight visits every knight square?

How about a simple one for a change? How fast can this position occur (with black to move since it's stalemate).

Here's my first try, 23.5 moves.

Now of course we have to do the reverse, to make it end in an even full number of moves!

I'll leave that one for those who feel that they have to do it.

I don’t think there is a name for this, although this is a very nice idea I didn’t realise! The b1 knight does end up on g1 though, so it is considered an impostor knight. However, the knight doesn’t need to visit b8 or g8 to be an impostor: it just needs to end up on the home square of the other knight.

I suppose it could also be a very literal knight's tour.

@6726

Unique SPG in 14.5. The knight swap is needed.

Ignore the above post, it isn’t unique: Ng8 has multiple ways to g1.

Here is EvinSung’s edited position.

Gotta love chess.com's unlimited edit policy.

Leaves solvers spinning their wheels, trying to hit a moving target.

The end lesson is not to engage posts so quickly. Just what any healthy forum needs.