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

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.

Bibliographic Details
Main Authors: Langerman, Stefan (Author), Demaine, Erik D (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer International Publishing, 2017-09-22T19:22:59Z.
Subjects:
Online Access:Get fulltext