Question 105
Kimothy starts in the bottom-left square of a $4 \times 4$ chessboard. In one step, he can move up, down, left, or right to an adjacent square. Kimothy takes $16$ steps and ends up where he started, visiting each square exactly once (except for his starting/ending square). How many paths could he have taken?