Knight Returns

In these problems, a knight starts on a square such as a1 and asks whether it can return to that same square in exactly $k$ moves.

This is a perfect first example of how a chess puzzle becomes mathematics.

Core Invariant: Colour Parity

A knight always moves to a square of the opposite colour.

That means:

• after an odd number of moves, the knight is on the opposite colour;
• after an even number of moves, it is back on the original colour.

So an immediate test is:

• return in odd $k$ moves: impossible;
• return in even $k$ moves: still not automatic, but now worth investigating.

Graph Viewpoint

Model the board as a graph:

• squares are vertices;
• legal knight moves are edges.

Then the question becomes:

• is there a closed walk of length $k$ starting from the chosen vertex?

This viewpoint explains why the small examples matter so much. Once you can find one short even return pattern, you can often repeat or splice it to build longer even return lengths.

Standard Proof Template

1. Use colouring to rule out odd lengths immediately.
2. Find one explicit even return pattern or short cycle.
3. Show how to repeat that pattern to construct larger even lengths.

The interesting part is that impossibility and construction come from the same graph structure.

Return to the Mathematics in Chess overview for the full collection.