Bust-a-Move/Puzzle Bobble is NP-Complete
Erik D. Demaine, Stefan Langerman
TL;DR
This paper proves that the classic Puzzle Bobble game is NP-complete, even with perfect information and only three bubble colors, highlighting its computational complexity.
Contribution
It establishes the NP-completeness of Puzzle Bobble under specific conditions, providing a formal computational complexity classification.
Findings
Puzzle Bobble is NP-complete with three colors.
The proof applies to the perfect-information version.
Complexity classification for a popular video game.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Digital Games and Media · Gambling Behavior and Treatments