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

Author(s)
Langerman, Stefan; Demaine, Erik D
Thumbnail
DownloadBust-a-move.pdf (645.9Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-complete. Our proof applies to the perfect-information version where the bubble sequence is known in advance, and it uses just three bubble colors.
Date issued
2016-11
URI
http://hdl.handle.net/1721.1/111629
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Discrete and Computational Geometry and Graphs
Publisher
Springer International Publishing
Citation
Demaine, Erik D., and Langerman, Stefan. “Bust-a-Move/Puzzle Bobble Is NP-Complete.” Discrete and Computational Geometry and Graphs (2016): 94–104 © 2016 The Author(s)
Version: Author's final manuscript
ISBN
978-3-319-48531-7
978-3-319-48532-4
ISSN
0302-9743
1611-3349
Collections