🔴 Riddle #222 of 240
A knight sits on square a1 of an otherwise empty chessboard. What is the smallest number of moves in which it can reach the opposite corner, h8?
Think about it first. When you're ready:
6 moves
A breadth-first search over knight moves gives 6 as the shortest route from a1 to h8, which is consistent with both corners being the same colour.