Playing Dominoes Is Hard, Except by Yourself
Author(s)Demaine, Erik D.; Ma, Fermi P.; Waingarten, Erik
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Fun with Algorithms
Demaine, Erik D., Fermi Ma, and Erik Waingarten. “Playing Dominoes Is Hard, Except by Yourself.” Fun with Algorithms (2014): 137–146.
Author's final manuscript