A chess knight always moves in an "L" shape: two squares in one direction and then one square to the side, or the other way around. Can you use one knight to visit every square exactly once and complete the tour? Click a square with a green border to make your move.
To avoid getting trapped at a dead end, the Warnsdorff's rule can help: always move first to the square with the fewest onward moves. A square with many possible moves can wait until later, but if you leave a square with very few options until the end, you may never be able to reach it.
Click any square to get started
💡 In mathematics, this type of path-finding problem is called a Hamiltonian path problem — the goal is to find a path that visits every vertex of a graph exactly once.