How fast can we play Tetris greedily with rectangular pieces?

DOI10.4230/LIPICS.FUN.2022.13MaRDI QIDQ6540581FDOQ6540581

Authors John Iacono 

Publication date 16 May 2024

zbMATH Keywords

dynamic data structuresfine-grained complexityaxis-aligned rectanglesTtetris

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: How fast can we play Tetris greedily with rectangular pieces?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540581)