Playing Dominoes Is Hard, Except by Yourself
Name
Demaine_Playing dominoes.pdf
Size
2.04 MB
Format
Adobe PDF
Checksum (MD5)
f0c42d319e557374a476b3c7615f9d3b
Author(s)
Demaine, Erik D.
Ma, Fermi P.
Waingarten, Erik
Date Issued
2014
Journal
Fun with Algorithms
Publisher
Springer-Verlag
Citation
Demaine, Erik D., Fermi Ma, and Erik Waingarten. “Playing Dominoes Is Hard, Except by Yourself.” Fun with Algorithms (2014): 137–146.
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-07890-8_12
