Steinhaus chessboard theorem

In combinatorial topology, the Steinhaus chessboard theorem is the following theorem, due to Hugo Steinhaus:Consider a chessboard on which some cells contain landmines. Then, either the king can cross the board from left to right without meeting a mined square, or the rook can cross the board from top to bottom moving only on mined squares.