IT-CESENATICO 1991 Problem 4
The squares of an board are colored black and white in such a way that every row and every column contains exactly four black squares. Prove that the number of pairs of neighboring white squares is the same as the number of pairs of neighboring black squares. (Two squares are neighboring if they have a side in common.)
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.