Problem: Given an chessboard, find a sequence of knight moves that visits every square exactly once, starting from a given position.
Link: CSES 1689
Constraints:
- Fixed board
- Knight moves in L-shape: squares in one direction, in perpendicular
Note: This is also a Hamiltonian path problem, but on a specific graph structure.