Problem - Knight's Tour

Problem: Given an $8 \times 8$ chessboard, find a sequence of knight moves that visits every square exactly once, starting from a given position.

Link: CSES 1689

Constraints:

• Fixed $8 \times 8$ board
• Knight moves in L-shape: $2$ squares in one direction, $1$ in perpendicular

Note: This is also a Hamiltonian path problem, but on a specific graph structure.