UNO is hard, even for a single player

Author(s)
Demaine, Erik D.; Demaine, Martin L.; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi
Thumbnail
DownloadDemaine_UNO is.pdf (109.9Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Date issued
2010-06
URI
http://hdl.handle.net/1721.1/62147
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-3-642-13121-9
3-642-13121-2
Collections