著者

Demaine Erik D. Demaine Martin L. Uehara Ryuhei Uno Takeaki Uno Yushi

出版者

Springer

雑誌

Lecture Notes in Computer Science (ISSN:03029743)

巻号頁・発行日

vol.6099, pp.133-144, 2010

被引用文献数

3

---

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 includecooperative 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.Fun with Algorithms : 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010.