Playing Dominoes Is Hard, Except by Yourself

@inproceedings{Demaine2014PlayingDI,
  title={Playing Dominoes Is Hard, Except by Yourself},
  author={Erik D. Demaine and Fermi Ma and Erik Waingarten},
  booktitle={FUN},
  year={2014}
}
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 singleplayer 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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Introduction to the Theory of Computation

SIGACT News • 1996
View 13 Excerpts
Highly Influenced

UNO is hard, even for a single player

Theor. Comput. Sci. • 2014
View 9 Excerpts

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory

M. Bóna
World Scientific • 2011
View 1 Excerpt

Domino history

Stormdark I.P., Media
http://www.domino-play.com/History. htm • 2010
View 1 Excerpt

Similar Papers

Loading similar papers…