dc.contributor.author | Langerman, Stefan | |
dc.contributor.author | Demaine, Erik D | |
dc.date.accessioned | 2017-09-22T19:22:59Z | |
dc.date.available | 2017-09-22T19:22:59Z | |
dc.date.issued | 2016-11 | |
dc.identifier.isbn | 978-3-319-48531-7 | |
dc.identifier.isbn | 978-3-319-48532-4 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/111629 | |
dc.description.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. | en_US |
dc.language.iso | en_US | |
dc.publisher | Springer International Publishing | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-319-48532-4_9 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | arXiv | en_US |
dc.title | Bust-a-Move/Puzzle Bobble Is NP-complete | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Demaine, Erik D., and Langerman, Stefan. “Bust-a-Move/Puzzle Bobble Is NP-Complete.” Discrete and Computational Geometry and Graphs (2016): 94–104 © 2016 The Author(s) | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.mitauthor | Demaine, Erik D | |
dc.relation.journal | Discrete and Computational Geometry and Graphs | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dspace.orderedauthors | Demaine, Erik D.; Langerman, Stefan | en_US |
dspace.embargo.terms | N | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
mit.license | OPEN_ACCESS_POLICY | en_US |