Some points on (integer, rectangular) grid in a plane are colored white, some black and some are not colored.
In each step, one vertical or horizontal line can be selected, and all colored points on that line would toggle their color.
Prove there is a finite sequence of steps after which on every vertical or horizontal line number of black and number of white points differs by 1 at most.
Black and White points on a grid
1
$\begingroup$
discrete-geometry
-
0@Casebash Colleague gave it to me. Maybe I missed something, I'll check with him. – 2010-08-12
1 Answers
5
What sequence of horizontal or vertical steps would lead
B W
W W
to have the number of black and white points almost even?
-
2+1. It is a $v$ery nice counterexample! Any row or column toggle will preser$v$e the 1-to-3 ratio, and so there can be no solution in this case. – 2010-08-12