Bust-a-Move/Puzzle Bobble Is NP-complete
Name
Bust-a-move.pdf
Size
645.94 KB
Format
Adobe PDF
Checksum (MD5)
b15e515c87aa1a6455093c9e7aea5a12
Author(s)
Langerman, Stefan
Demaine, Erik D
Date Issued
November 2016
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
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-48532-4_9
