# Guarini's Puzzle

There are 4 knights on a $3\times 3$ chessboard: two white knights at the bottom corners and two black knights at the upper corners.

What is the minimum number of moves required so that the two white knights end up at the upper corners and the two black knights end up at the bottom corners?

×