News for hackers. Stuff that matters.
Re:Mutilated chessboard problem by Grustaf on Sunday October 04, 2015 @04:55PM (#10328774)
The problem where one square of each is colour is removed is much more interesting. It's not obvious to me why it should always be possible to solve that problem, regardless of which squares are removed, but apparently it is.

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)?

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.