MathDB

(301) 2

Part of 1991 Tournament Of Towns

Problems(1)

TOT 301 1991 Autumn O J2 flying rook on 4x4 chessboard

Source:

6/9/2024
The “flying rook” moves as the usual chess rook but can’t move to a neighbouring square in one move. Is it possible for the flying rook on a 4×44 \times 4 chess-board to visit every square once and return to the initial square in 1616 moves?
(A. Tolpygo, Kiev)
combinatorics