A tessellation (or tiling) is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. It is clear that any 2n × 2n square can be tiled by 2 × 1 rectangular tiles (called dominoes) in a number of different patterns. Let us say that a tiling is interlocking if the 2n × 2n square cannot be partitioned into two rectangles that freely slide along each other. Show that the smallest square that admits an interlocking tiling with dominoes is the 8 × 8 square.
I can find a tiling so that the 8 x 8 fails but I don't know how to go about proving that it is the smallest case? It's pretty easy to show why the 2 x 2 and 4 x 4 works, but I'm not sure how to go about showing the 6 x 6 case always working.