• Citer

Bust-a-move/puzzle bobble is NP-complete

par Demaine, Erik D. ;Langerman, Stefan
Référence Lecture notes in computer science, 9943 LNCS, page (94-104)
Publication Publié, 2016

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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.