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 .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
