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

  • Erik D. DemaineEmail author
  • Stefan Langerman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9943)


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.


Bubble Sort Poppable Bubble Super Mode Rebound Angle Direct Shot 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



We thank Giovanni Viglietta for helpful discussions, in particular for pointing out bugs in earlier versions of this proof.


  1. [BDH+04]
    Breukelaar, R., Demaine, E.D., Hohenberger, S., Jan Hoogeboom, H., Kosters, W.A., Liben-Nowell, D.: Tetris is hard, even to approximate. Int. J. Comput. Geom. Appl. 14(1–2), 41–68 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. [Hun11]
    Hunt, S.: Bubble memories: 25 years of bubble bobble. Retro Gamer 95, 26–35 (2011)Google Scholar
  3. [Thea]
    The international arcade museum: bubble bobble.
  4. [Theb]
    The international arcade museum: puzzle bobble.
  5. [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
  6. [Wik]
    Wikipedia, the free encyclopedia: puzzle bobble.
  7. [YDD89]
    Young, M.C., Dike, M., Doss, M.: Bust a move. In: Proceedings of Stone Cold Rhymin’. Delicious Vinyl (1989)Google Scholar

Copyright information

© The Author(s) 2016

Authors and Affiliations

  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  2. 2.Départment d’InformatiqueUniversité Libre de BruxellesBrusselsBelgium

Personalised recommendations