Advertisement

UNO Is Hard, Even for a Single Player

  • Erik D. Demaine
  • Martin L. Demaine
  • Ryuhei Uehara
  • Takeaki Uno
  • Yushi Uno
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6099)

Abstract

UNO\(\mbox{}^{\scriptsize\textregistered}\) is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise mathematical models for it. They include cooperative and uncooperative versions of UNO, for example. As a result of analyzing their computational complexities, we prove that even a single-player version of UNO is NP-complete, while it becomes in P in some restricted cases. We also show that uncooperative two-player’s version is PSPACE-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bertossi, A.A.: The edge Hamiltonian path problem is NP-complete. Information Processing Letters 13, 157–159 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Demaine, E.D.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 18–32. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Demaine, E.D., Demaine, M.L., Uehara, R., Uno, T., Uno, Y.: The complexity of UNO. CoRR abs/1003.2851 (2010)Google Scholar
  4. 4.
    Even, S., Tarjan, R.E.: A combinatorial problem which is complete in polynomial space. J. ACM 23, 710–719 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gardner, M.: Mathematical Games: The Entire Collection of his Scientific American Columns. The Mathematical Association of America (2005)Google Scholar
  6. 6.
    Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit is NP-complete. SIAM Journal of Computing 5, 704–714 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  8. 8.
    Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A.K. Peters (2009)Google Scholar
  9. 9.
    Lai, T.-H., Wei, S.-S.: The edge Hamiltonian path problem is NP-complete for bipartite graphs. Information Processing Letters 46, 21–26 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Lichtenstein, D., Sipser, M.: GO is polynomial-space hard. J. ACM 27, 393–401 (1980)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • Martin L. Demaine
    • 1
  • Ryuhei Uehara
    • 2
  • Takeaki Uno
    • 3
  • Yushi Uno
    • 4
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  2. 2.School of Information ScienceJAISTJapan
  3. 3.National Institute of InformaticsTokyoJapan
  4. 4.Graduate School of ScienceOsaka Prefecture UniversityJapan

Personalised recommendations