6 0 0 0 IR UNO Is Hard, Even for a Single Player
- 著者
- 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.
1 0 0 0 OA UNO is hard, even for a single player
- 著者
- Demaine Erik D. Demaine Martin L. Harvey Nicholas J. A. Uehara Ryuhei Uno Takeaki Uno Yushi
- 出版者
- Elsevier
- 雑誌
- Theoretical Computer Science (ISSN:03043975)
- 巻号頁・発行日
- vol.521, pp.51-61, 2013-11-22
- 被引用文献数
- 8
This paper investigates the popular card game UNO from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze their computational complexity. In particular, we prove that even a single-player version of UNO is NP-complete, although some restricted cases are in P. Surprisingly, we show that the uncooperative two-player version is also in P.