Tetris and decidability

DOI10.1016/j.ipl.2003.12.006zbMath1178.68258OpenAlexW2069105779MaRDI QIDQ1029095

Hendrik Jan Hoogeboom, Walter A. Kosters

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.12.006

zbMATH Keywords

decidabilitytheory of computationtetris

Mathematics Subject Classification ID

Related Items

How fast can we play Tetris greedily with rectangular pieces? ⋮ Combinatorial analysis of tetris-like games

Cites Work

• Tetris is Hard, Even to Approximate
• Covering a Rectangle with T-Tetrominoes
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item