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.
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Springer International Publishing
2017
|
| Online Access: | http://hdl.handle.net/1721.1/111629 https://orcid.org/0000-0003-3803-5703 |