Combinatorial analysis of tetris-like games

DOI10.1016/j.disc.2007.08.009zbMath1146.91013OpenAlexW2069043956MaRDI QIDQ941345

Donatella Merlini, Davide Baccherini

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.009

zbMATH Keywords

probability generating functionsfinite state automatonSchützenberger methodology

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorial games (91A46)

Related Items (1)

How fast can we play Tetris greedily with rectangular pieces?

Cites Work

• Unnamed Item
• Unnamed Item
• Tetris and decidability
• Domino tilings of rectangles with fixed width
• Tiling rectangles with polyominoes
• Strip tiling and regular grammars
• A strip-like tiling algorithm
• On dimer coverings of rectangles of fixed width
• The statistics of dimers on a lattice
• TETRIS IS HARD, EVEN TO APPROXIMATE
• Tablatures for Stringed Instruments and Generating Functions
• On context-free languages and push-down automata

This page was built for publication: Combinatorial analysis of tetris-like games