# Swap the positions of the 4 chess knights

The puzzle seems simple enough. It is only a few squares and you only have four knights (the knights move in an “L” shape, like in regular chess). The goal is also straightforward: swap the positions of the black and white knights.

Clarification 1: Every time a knight moves, it must move into an empty square.

Clarification 2: The knight moves do not have to alternate in color.

• I feel like all knights swap problems is the same after you make the connectivity graph 🤔 Commented Jul 20 at 5:25
• @justhalf In a sense yes, but making the step to the connectivity graph is non-trivial. If you know this technique then all knight swap problems can be solved with it. If you don't know it knight swap problems can be quite hard. Commented Jul 21 at 11:31
• @quarague yea, so the so-called variations of knight problems most of them have the same solution, which is to convert it to connectivity graph and trivial from there. There are some knight move puzzles which are still not trivial after converting, those are interesting. Commented Jul 21 at 11:35