Abstract
In this paper we are interested in the Pentomino Exclusion Problem due to Golomb: Find the minimum number of unit squares to be placed on a k\times n chessboard so as to exclude all pentominoes . Using an appropriate definition of density of a tiling, we obtain the asymptotic value of this number, and we establish this number for the k\times n chessboard when k≤ 4 .
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received June 7, 1999, and in revised form March 1, 2001. Online publication August 9, 2001.
Rights and permissions
About this article
Cite this article
Gravier, S., Payan, C. On the Pentomino Exclusion Problem. Discrete Comput Geom 26, 375–386 (2001). https://doi.org/10.1007/s00454-001-0036-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-001-0036-9