"Each cell of a 100 × 100 table is painted either black or white and all the cells adjacent to the border of the table are black. It is known that in every 2 × 2 square there are cells of both colours. Prove that in the table there is 2 × 2 square that is coloured in the chessboard manner."
How to solve this problem?
Hint: Stick $99\times 99$ needles on this grid, each at a place where four cells meet in a corner. For each pair of needles at distance one apart, connect them with a piece of string if the the two squares touching the edge between them have different colors.
Each needle with have either $2$ or $4$ pieces of string tied to it (why?). If a needle has four strings, then the four squares surrounding it are colored like a checkerboard. So, assume to the contrary that every needle only has two strings. What would the resulting picture look like? Why is that impossible?
Further hint: