Find all squares. if they exist, on an 8×8 checkerboard such that the board obtained by removing one of these square can be tiled using straight triominoes.[Hint: First use arguments, based on coloring and rotations to eliminate as many squares as possible from consideration.]
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.