JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >

このアイテムの引用には次の識別子を使用してください: http://hdl.handle.net/10119/12143

タイトル: UNO is hard, even for a single player
著者: Demaine, Erik D.
Demaine, Martin L.
Harvey, Nicholas J. A.
Uehara, Ryuhei
Uno, Takeaki
Uno, Yushi
キーワード: algorithmic combinatorial game theory
dynamic programming
Hamiltonian path
mathematical puzzles/games
発行日: 2013-11-22
出版者: Elsevier
誌名: Theoretical Computer Science
巻: 521
開始ページ: 51
終了ページ: 61
DOI: 10.1016/j.tcs.2013.11.023
抄録: 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
資料タイプ: author
出現コレクション:b10-1. 雑誌掲載論文 (Journal Articles)


ファイル 記述 サイズ形式
20099.pdf251KbAdobe PDF見る/開く



お問い合わせ先 : 北陸先端科学技術大学院大学 研究推進課図書館情報係