Clumsy Packing of Polyominoes in Finite Space
Combinatorics
2022-03-15 v1 General Topology
Abstract
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, , , and plus polyominoes of various sizes.
Keywords
Cite
@article{arxiv.2203.06675,
title = {Clumsy Packing of Polyominoes in Finite Space},
author = {Emma Miller and Mitchel O'Connor and Nathan Shank},
journal= {arXiv preprint arXiv:2203.06675},
year = {2022}
}
Comments
22 pages