From Tetris to polyominoes generation
From MaRDI portal
Publication:1687782
DOI10.1016/j.endm.2017.05.007zbMath1427.05049OpenAlexW2623559693MaRDI QIDQ1687782
Enrico Formenti, Paolo Massazza
Publication date: 4 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.05.007
Related Items (3)
How fast can we play Tetris greedily with rectangular pieces? ⋮ Partially directed animals with a bounded number of holes ⋮ A Dynamical System Approach to Polyominoes Generation*
Cites Work
- On the exhaustive generation of \(k\)-convex polyominoes
- Algebraic languages and polyominoes enumeration
- On the generation and enumeration of some classes of convex polyominoes
- A method for the enumeration of various classes of column-convex polygons
- On the generation of convex polyominoes
- The number of Z-convex polyominoes
- Reconstruction of L-convex Polyominoes
- Statistics of lattice animals (polyominoes) and polygons
- From Linear Partitions to Parallelogram Polyominoes
- An Efficient Algorithm for the Generation of Z-Convex Polyominoes
- Checker Boards and Polyominoes
- Enumerations of lattice animals and trees
This page was built for publication: From Tetris to polyominoes generation
