Re:Mutilated chessboard problem
by ColinWright on Sunday October 04, 2015 @04:56PM
(#10328781)
Yes - there is a simple, clear, elegant way to see that removing one square of each colour leaves the board coverable. It's even given in the article.
I wonder if it can be proved without resorting to looking at classes of cases (removed squares right next to each other, removed squares with two squares between them, etc)?