dc.contributor.author | Demaine, Erik D. | |
dc.contributor.author | Ma, Fermi P. | |
dc.contributor.author | Waingarten, Erik | |
dc.date.accessioned | 2015-11-23T15:42:25Z | |
dc.date.available | 2015-11-23T15:42:25Z | |
dc.date.issued | 2014 | |
dc.identifier.isbn | 978-3-319-07889-2 | |
dc.identifier.isbn | 978-3-319-07890-8 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/99993 | |
dc.description.abstract | Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a set of domino tiles, each with two labeled square faces, and take turns connecting them into a growing chain of dominoes by matching identical faces. We show that single-player dominoes is in P, while multiplayer dominoes is hard: when players cooperate, the game is NP-complete, and when players compete, the game is PSPACE-complete. In addition, we show that these hardness results easily extend to games involving team play. | en_US |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-319-07890-8_12 | 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 | MIT web domain | en_US |
dc.title | Playing Dominoes Is Hard, Except by Yourself | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Demaine, Erik D., Fermi Ma, and Erik Waingarten. “Playing Dominoes Is Hard, Except by Yourself.” Fun with Algorithms (2014): 137–146. | 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. | en_US |
dc.contributor.mitauthor | Ma, Fermi P. | en_US |
dc.contributor.mitauthor | Waingarten, Erik | en_US |
dc.relation.journal | Fun with Algorithms | 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.; Ma, Fermi; Waingarten, Erik | en_US |
dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
dspace.mitauthor.error | true | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |