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/9860

Title: UNO Is Hard, Even for a Single Player
Authors: Demaine, Erik D.
Demaine, Martin L.
Uehara, Ryuhei
Uno, Takeaki
Uno, Yushi
Keywords: UNO
computational complexity
game and puzzle
PSPACE-completeness
NP-completeness
Issue Date: 2010
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 6099/2010
Start page: 133
End page: 144
DOI: 10.1007/978-3-642-13122-6_15
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 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.
Rights: This is the author-created version of Springer, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno, Lecture Notes in Computer Science, 6099/2010, 2010, 133-144. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-13122-6_15
URI: http://hdl.handle.net/10119/9860
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
15190-1.pdf95KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, JAIST (ir-sys[at]ml.jaist.ac.jp)