  Clumsy packing is considered an inefficient packing, meaning we find the
minimum number of objects we can pack into a space so that we can not pack any
more object. Thus we are effectively spacing out the objects as far apart as
possible so that we can not fit another object. In this paper we consider
clumsy packing of polyominoes in a finite spaces which must consider boundary
conditions. We examine rectangle, $L$, $T$, and plus polyominoes of various
sizes.
