Problem

Source:

Tags: Chessboard, combinatorics



Eight rooks are placed on a chessboard so that no two rooks attack each other. Prove that one can always move all rooks, each by a move of a knight so that in the final position no two rooks attack each other as well. (In intermediate positions several rooks can share the same square).