UNO Is Hard, Even for a Single Player

UNO $\mbox{}^{\scriptsize\textregistered}$ 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 include cooperative and uncooperative versions of U...

Full description

Saved in:
Bibliographic Details
Published inFun with Algorithms Vol. 6099; pp. 133 - 144
Main Authors Demaine, Erik D., Demaine, Martin L., Uehara, Ryuhei, Uno, Takeaki, Uno, Yushi
Format Book Chapter
LanguageEnglish
Published Germany Springer Berlin / Heidelberg 2010
Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Online AccessGet full text
ISBN9783642131219
3642131212
ISSN0302-9743
1611-3349
DOI10.1007/978-3-642-13122-6_15

Cover

Abstract UNO $\mbox{}^{\scriptsize\textregistered}$ 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 include cooperative 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.
AbstractList UNO $\mbox{}^{\scriptsize\textregistered}$ 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 include cooperative 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.
Author Uno, Takeaki
Uehara, Ryuhei
Uno, Yushi
Demaine, Erik D.
Demaine, Martin L.
Author_xml – sequence: 1
  givenname: Erik D.
  surname: Demaine
  fullname: Demaine, Erik D.
  email: edemaine@mit.edu
  organization: MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA
– sequence: 2
  givenname: Martin L.
  surname: Demaine
  fullname: Demaine, Martin L.
  email: mdemaine@mit.edu
  organization: MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, USA
– sequence: 3
  givenname: Ryuhei
  surname: Uehara
  fullname: Uehara, Ryuhei
  email: uehara@jaist.ac.jp
  organization: School of Information Science, JAIST, Japan
– sequence: 4
  givenname: Takeaki
  surname: Uno
  fullname: Uno, Takeaki
  email: uno@nii.jp
  organization: National Institute of Informatics, Tokyo, Japan
– sequence: 5
  givenname: Yushi
  surname: Uno
  fullname: Uno, Yushi
  email: uno@mi.s.osakafu-u.ac.jp
  organization: Graduate School of Science, Osaka Prefecture University, Japan
BookMark eNpVkEFPwzAMhQMMRBn7Bxx64UYgjt00OaJpwKSJIcHOUdqlwJjakRQk_j3ZxgUfbOlZn633ztig7VrP2AWIaxCivDGl5sgVSQ4IUnJloThgoyRjEneaOmQZKACOSObo3w7MgGUCheSmJDxhmSoIjVZanbJRjCuRikiRpoxdLh7n-TTmDy4sr_LJt2_zpgu5y5_f29e1z5_W7seHc3bcuHX0o785ZIu7ycv4gc_m99Px7YyvsMCel877mhoNFblGo5Na15UsKly6oixMacSSNABqV6Reka7RawSFqKQx2OCQyf3duAnpvw-26rqPaEHYbS42mbRok027y8Buc0kQ7aFN6D6_fOyt31K1b_vg1vWb2_Q-RItCFUhkAcACAf4C99FeYw
ContentType Book Chapter
Copyright Springer-Verlag Berlin Heidelberg 2010
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2010
DBID FFUUA
DOI 10.1007/978-3-642-13122-6_15
DatabaseName ProQuest Ebook Central - Book Chapters - Demo use only
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9783642131226
3642131220
EISSN 1611-3349
Editor Boldi, Paolo
Gargano, Luisa
Editor_xml – sequence: 1
  fullname: Boldi, Paolo
– sequence: 2
  fullname: Gargano, Luisa
EndPage 144
ExternalDocumentID EBC3065344_111_141
GroupedDBID 089
0D6
0DA
2HV
38.
4UP
4V3
A4J
AABBV
AAJYQ
AATVQ
ABBUY
ABBVZ
ABCYT
ABMKK
ABMNI
ACDPG
ACDTA
ACDUY
ACWCF
ACZTO
AEDXK
AEHEY
AEJLV
AEKFX
AEOKE
AETDV
AEZAY
AHNNE
AHSMR
ALMA_UNASSIGNED_HOLDINGS
ATJMZ
AZZ
BBABE
CZZ
FFUUA
I4C
IEZ
IW0
JJU
MA.
MW~
MYL
SBO
TBMHI
TPJZQ
TSXQS
Z83
Z84
Z88
-DT
-GH
-~X
1SB
29L
2HA
5QI
875
AASHB
ACGFS
ADCXD
AEFIE
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-j353t-7aeec4f81b4af83a288cb25b3da5759790d481138a5113b48c3e83163362993f3
ISBN 9783642131219
3642131212
ISSN 0302-9743
IngestDate Wed Sep 17 03:53:24 EDT 2025
Tue Oct 21 02:49:01 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
LCCallNum QA76.6-76.66
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-j353t-7aeec4f81b4af83a288cb25b3da5759790d481138a5113b48c3e83163362993f3
Notes Original Abstract: UNO\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mbox{}^{\scriptsize\textregistered}$\end{document} 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 include cooperative 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.
OCLC 654398686
OpenAccessLink http://hdl.handle.net/10119/9860
PQID EBC3065344_111_141
PageCount 12
ParticipantIDs springer_books_10_1007_978_3_642_13122_6_15
proquest_ebookcentralchapters_3065344_111_141
PublicationCentury 2000
PublicationDate 2010
PublicationDateYYYYMMDD 2010-01-01
PublicationDate_xml – year: 2010
  text: 2010
PublicationDecade 2010
PublicationPlace Germany
PublicationPlace_xml – name: Germany
– name: Berlin, Heidelberg
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSubtitle 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010, Proceedings
PublicationTitle Fun with Algorithms
PublicationYear 2010
Publisher Springer Berlin / Heidelberg
Springer Berlin Heidelberg
Publisher_xml – name: Springer Berlin / Heidelberg
– name: Springer Berlin Heidelberg
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Nierstrasz, Oscar
Steffen, Bernhard
Kittler, Josef
Vardi, Moshe Y.
Weikum, Gerhard
Sudan, Madhu
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, UK
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, UK
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: Oscar
  surname: Nierstrasz
  fullname: Nierstrasz, Oscar
  organization: University of Bern, Bern, Switzerland
– sequence: 9
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology, Madras, India
– sequence: 10
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: University of Dortmund, Dortmund, Germany
– sequence: 11
  givenname: Madhu
  surname: Sudan
  fullname: Sudan, Madhu
  organization: Massachusetts Institute of Technology, USA
– sequence: 12
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 13
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 14
  givenname: Moshe Y.
  surname: Vardi
  fullname: Vardi, Moshe Y.
  organization: Rice University, Houston, USA
– sequence: 15
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max-Planck Institute of Computer Science, Saarbrücken, Germany
SSID ssj0000446484
ssj0002792
Score 1.8670894
Snippet UNO $\mbox{}^{\scriptsize\textregistered}$ is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial...
SourceID springer
proquest
SourceType Publisher
StartPage 133
Title UNO Is Hard, Even for a Single Player
URI http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=3065344&ppg=141
http://link.springer.com/10.1007/978-3-642-13122-6_15
Volume 6099
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELVouSAO7GKXD3AKRk3sLD2WqggqlgMU9WY5rgNCqCwpB_h6ZmKnS-gFLlEUJZE9L5rMePzmEXIUK5Vq-O2ypgozJiLhM8WbmmGRE_UY_ShEgvP1TXTRE91-2J-oexbsklF6qr_n8kr-gypcA1yRJfsHZMcvhQtwDvjCERCGYyX4nV1mtbpDn5aB7bVeHl8hxX9yfccd_r2bW-8yR5JOgWEHnJrdMendwd_qxaBc0Zfbmuuy_mLz2HTWX676ea4pFrY4n9cYqyBpiMDnfumZnNOLGlaX6JcHnd40AU8yfDRgkbSky9mG1b7tWVVpWN05a6McPRcC0wuJN729M9T5wnq4Ez2pkRoMrU4WW53u1cN4VQzLyyJBLa7xsAPbJmkyjSkC5LxhzqQKlep2ETTcr5JlJJJQZHjAwNfIghmuk5VSRoM6r7pBjgEqeplThOqEIlAUgKKKWqCoBWqT9M479-0L5tQr2DMP-YjFyhgtMkgLhMoSroIk0WkQpnygUBQ1bjYGIvF9niiIeXkqEs1NwiE8hpACgsaMb5H68HVotgkNGpEKjQ4DoSDgwqZsQVPFsY4hAMnS0OwQVk5ZFjV2t7FX2wnmsoLHDvFKu0i8PZdl82owqOQSDCoLg0o06O4f375HliZf7D6pjz4-zQFEbqP00MH9AzP_NuM
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Fun+with+Algorithms&rft.atitle=UNO+Is+Hard%2C+Even+for+a+Single+Player&rft.date=2010-01-01&rft.pub=Springer+Berlin+%2F+Heidelberg&rft.isbn=9783642131219&rft.volume=6099&rft_id=info:doi/10.1007%2F978-3-642-13122-6_15&rft.externalDBID=141&rft.externalDocID=EBC3065344_111_141
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F3065344-l.jpg