Abstract
Abstract
Tetrominos, comprised of four identical squares joined together along edges, have achieved substantial popular recognition as the elemental components of the widely known game, Tetris. In this paper, we present a recursive formula aimed at exact enumeration of tetromino tilings on a rectangular board with dimensions m × n. Furthermore, we modify the tiling criterion to mirror the Tetris gameplay, resulting in what we term Tetris tiling of height n. By employing this adjusted condition, we accurately calculate the total number of Tetris tilings. Additionally, the asymptotic behavior of the growth rate associated with the tetromino tiling is discussed.
Funder
National Research Foundation of Korea
Subject
Condensed Matter Physics,Mathematical Physics,Atomic and Molecular Physics, and Optics
Reference19 articles.
1. Complexity of solvable cases of the decision problem for predicate calculus;Lewis,1978
2. Enumeration of matchings: problems and progress;Propp;New Perspectives in Geometric Combinatorics, MSRI Publications,1999
3. Theory of monomer-dimer systems;Heilmann;Commun. Math. Phys.,1972