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. © 2010 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Demaine, E. D., Demaine, M. L., Uehara, R., Uno, T., & Uno, Y. (2010). UNO is hard, even for a single player. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6099 LNCS, pp. 133–144). https://doi.org/10.1007/978-3-642-13122-6_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
