# Black and White points on a grid

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.

-
What is a line? Is it a line segment of an arbitrary finite length, a fixed finite length, length one, or of infinite length? – Qiaochu Yuan Aug 12 '10 at 3:09
Very likely, it's a m-by-n grid, vertical line' means all points (x,y) for some x and $1 \le y \le n$, horizontal line' means all points (x,y) for some y and $1 \le x \le m$. – rgrig Aug 12 '10 at 8:40
Where'd you get the question from? – Casebash Aug 12 '10 at 11:09
If we assume that a particular grid can be solved - unlike in the counter-example I posted below - the maximum number of moves to solve would be $\lfloor \frac m2 \rfloor + \lfloor \frac n2 \rfloor$. The monochromatic grids of size m-by-n satisfy this bound. – Joshua Shane Liberman Aug 12 '10 at 11:53
@Casebash Colleague gave it to me. Maybe I missed something, I'll check with him. – n0vakovic Aug 12 '10 at 12:41