UNO is hard, even for a single player
Name
Demaine_UNO is.pdf
Size
109.95 KB
Format
Adobe PDF
Checksum (MD5)
7b17c7281d0810309971b9990625aeae
Author(s)
Demaine, Erik D.
Demaine, Martin L.
Uehara, Ryuhei
Uno, Takeaki
Uno, Yushi
Date Issued
June 2010
Journal
Proceedings of the 5th International Conference on Fun with Algorithms
Publisher
Springer-Verlag
Citation
Demaine, Erik D. et al. “UNO is hard, even for a single player.” Proceedings of the 5th International Conference on Fun with Algorithms. Iscia, Italy: Springer-Verlag, 2010. 133-144.
Version
Author's final manuscript
Abstract
UNO® 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.
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 3.0
Persistent DSpace Link
DOI of Published Version
http://portal.acm.org/citation.cfm?id=1875631
