Show simple item record

dc.contributor.authorLangerman, Stefan
dc.contributor.authorDemaine, Erik D
dc.date.accessioned2017-09-22T19:22:59Z
dc.date.available2017-09-22T19:22:59Z
dc.date.issued2016-11
dc.identifier.isbn978-3-319-48531-7
dc.identifier.isbn978-3-319-48532-4
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/1721.1/111629
dc.description.abstractWe 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.isoen_US
dc.publisherSpringer International Publishingen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-319-48532-4_9en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleBust-a-Move/Puzzle Bobble Is NP-completeen_US
dc.typeArticleen_US
dc.identifier.citationDemaine, 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.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorDemaine, Erik D
dc.relation.journalDiscrete and Computational Geometry and Graphsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsDemaine, Erik D.; Langerman, Stefanen_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record