Friday Puzzler (cont'd) -- Chess Board 2 of 3
Alex Y
Larry correctly pointed out that all the squares on a diagonal in a chess board are the same color, so removing two diagonally opposite corners would leave two fewer squares of one color than the other -- impossible to tile with dominoes that cover one of each color.
The next puzzle is what happens if you eliminate one square of each color. Some examples are trivial, e.g. if you remove a1 and b1. But are there examples of one white and one black square, that if removed will result in a board that cannot be tiled with 31 dominoes?
If so, provide an example.
If not, prove that it can be tiled no matter which black square and while square are eliminated.
