Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Fermi Ma, and Erik Waingarten, “Playing Dominoes is Hard, Except by Yourself”, in Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), Lipari Island, Italy, July 1–3, 2014, pages 137–146.

BibTeX

@InProceedings{Dominoes_FUN2014,
  AUTHOR        = {Erik D. Demaine and Fermi Ma and Erik Waingarten},
  TITLE         = {Playing Dominoes is Hard, Except by Yourself},
  BOOKTITLE     = {Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014)},
  bookurl       = {http://www.di.unipi.it/fun14/},
  ADDRESS       = {Lipari Island, Italy},
  MONTH         = {July 1--3},
  YEAR          = 2014,
  PAGES         = {137--146},

  withstudent   = 1,
  doi           = {https://dx.doi.org/10.1007/978-3-319-07890-8_12},
  dblp          = {https://dblp.org/rec/conf/fun/DemaineMW14},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1007/978-3-319-07890-8_12">SpringerLink</A>.},
}

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.

Comments:

This paper is also available from SpringerLink.

Availability:

The paper is available in PDF (2203k).

See information on file formats.

[Google Scholar search]