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.
KeywordsBubble Sort Poppable Bubble Super Mode Rebound Angle Direct Shot
We thank Giovanni Viglietta for helpful discussions, in particular for pointing out bugs in earlier versions of this proof.
- [Hun11]Hunt, S.: Bubble memories: 25 years of bubble bobble. Retro Gamer 95, 26–35 (2011)Google Scholar
- [Thea]The international arcade museum: bubble bobble. http://www.arcade-museum.com/game_detail.php?game_id=7222
- [Theb]The international arcade museum: puzzle bobble. http://www.arcade-museum.com/game_detail.php?game_id=9169
- [Vig12]Viglietta, G.: Gaming is a hard job, but someone has to do it! In: Proceedings of the 6th International conference on Fun with Algorithms, pp. 357–367 (2012)Google Scholar
- [Wik]Wikipedia, the free encyclopedia: puzzle bobble. http://en.wikipedia.org/wiki/Puzzle_Bobble
- [YDD89]Young, M.C., Dike, M., Doss, M.: Bust a move. In: Proceedings of Stone Cold Rhymin’. Delicious Vinyl (1989)Google Scholar