|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/12143
|
| Title: | UNO is hard, even for a single player |
| Authors: | Demaine, Erik D.
Demaine, Martin L.
Harvey, Nicholas J. A.
Uehara, Ryuhei
Uno, Takeaki
Uno, Yushi |
| Keywords: | algorithmic combinatorial game theory
dynamic programming
Hamiltonian path
mathematical puzzles/games |
| Issue Date: | 2013-11-22 |
| Publisher: | Elsevier |
| Magazine name: | Theoretical Computer Science |
| Volume: | 521 |
| Start page: | 51 |
| End page: | 61 |
| DOI: | 10.1016/j.tcs.2013.11.023 |
| Abstract: | 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. |
| Rights: | NOTICE: This is the author's version of a work accepted for publication by Elsevier. Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Theoretical Computer Science, 521, 2013, 51-61, http://dx.doi.org/10.1016/j.tcs.2013.11.023 |
| URI: | http://hdl.handle.net/10119/12143 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 20099.pdf | | 251Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
