Find all squares, if they exist, on an 8 x 8 checkerboard
Chapter 1, Problem 1.7.46(choose chapter or problem)
Find all squares, if they exist, on an 8 x 8 checkerboard so 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.]
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer