On an infinite grid of squares, 100 cells are coloured black while all other cells are coloured white. In a single move, you may toggle the colour of any four cells that form a square. Prove that it is possible to turn all cells white after a finite number of moves if and only if every row and every column contains an even number of black cells.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →