I am curious. Are all boards that have equal white and black tiles counts solvable?
Alternative proof: no, by example. Consider the shape made up by the X's in
XXX
.X.
.X.
XXX
(All maths proofs should be presented alongside a proof of the opposite result, to allow the reader to judge which one is likely to have slipped something past you. My favourite presentation following this rule is Mental Poker [0] by the authors of RSA.)