The Journey Of The King

Two squares on an \(8\times8\) chessboard are called touching if they have at least one common vertex. Determine if it is possible for a king to begin in some square and visit all the squares exactly once in such a way that all moves except the first are made into squares touching an even number of squares already visited.

×

Problem Loading...

Note Loading...

Set Loading...