Did you know that the knight can visit each square on a chessboard exactly once? Pretty interesting, right? This is called the knight’s tour, and it is a common problem given to computer science students. A knight’s tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. Btw, if you are interested in chess, you should read Irving Chernev’s book Logical Chess: Move By Move: Every Move Explained.
