Polyominoes are a subset of polygons which can be constructed from
integer-length squares fused at their edges. A system of polygons P is
interlocked if no subset of the polygons in P can be removed arbitrarily far
away from the rest. It is already known that polyominoes with four or fewer
squares cannot interlock. It is also known that determining the interlockedness
of polyominoes with an arbitrary number of squares is PSPACE hard. Here, we
prove that a system of polyominoes with five or fewer squares cannot interlock,
and that determining interlockedness of a system of polyominoes including
hexominoes (polyominoes with six squares) or larger polyominoes is PSPACE hard.Comment: 18 pages, 15 figure