kings tour and dominoes
Source: RS2004
March 20, 2005
combinatorics proposedcombinatorics
Problem Statement
An chessboard is completely tiled by dominoes. Prove that there exist a king's tour
of that chessboard such that every cell of the board is visited exactly once and such that king goes domino by
domino, i.e. if king moves to the first cell of a domino, it must move to another cell in the next move. (King
doesn't have to come back to the initial cell. King is an usual chess piece.)