Tke king visiting each square exactly once on a chessboard
Source: Baltic Way 1999
December 23, 2010
combinatorics proposedcombinatorics
Problem Statement
Two squares on an chessboard are called adjacent if they have a common edge or common corner. Is it possible for a king to begin in some square and visit all squares exactly once in such a way that all moves except the first are made into squares adjacent to an even number of squares already visited?