Bust-a-Move/Puzzle Bobble Is NP-complete

DOI10.1007/978-3-319-48532-4_9zbMath1482.68105arXiv1506.08409OpenAlexW795678656MaRDI QIDQ2958090

Erik D. Demaine, Stefan Langerman

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08409

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic game theory and complexity (91A68)

Related Items (1)

Twenty years of progress of \(\mathrm{JCDCG}^3\)

Cites Work

• TETRIS IS HARD, EVEN TO APPROXIMATE

This page was built for publication: Bust-a-Move/Puzzle Bobble Is NP-complete