A nice PHP BAMO problem
Source:
July 22, 2019
Chessboardcombinatorics
Problem Statement
Place eight rooks on a standard chessboard so that no two are in the same row or column. With the standard rules of chess, this means that no two rooks are attacking each other. Now paint of the remaining squares (not currently occupied by rooks) red. Prove that no matter how the rooks are arranged and which set of squares are painted, it is always possible to move some or all of the rooks so that:• All the rooks are still on unpainted squares.
• The rooks are still not attacking each other (no two are in the same row or same column).
• At least one formerly empty square now has a rook on it; that is, the rooks are not on the same squares as before.