MathDB
lightly damaged rook on a mxn chessboard

Source: 12th or 13th QEDMO problem 1 (11. - 15. 12. 2013) https://artofproblemsolving.com/community/c2400093_2013_qedmo_13th_or_12th

July 5, 2021
combinatoricsChessboard

Problem Statement

A lightly damaged rook moves around on a m×nm \times n chessboard by taking turns moves to a horizontal or vertical field. For which mm and nn, is it possible for him to have visited each field exactly once? The starting field counts as visited, squares skipped during a move, however, are not.