Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno, “UNO is hard, even for a single player”, Theoretical Computer Science, volume 521, February 2014, pages 51–61.

BibTeX

@Article{Uno_TCS,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Ryuhei Uehara and Takeaki Uno and Yushi Uno},
  TITLE         = {{UNO} is hard, even for a single player},
  JOURNAL       = {Theoretical Computer Science},
  journalurl    = {https://link.springer.com/journal/224},
  VOLUME        = 521,
  MONTH         = {February},
  YEAR          = 2014,
  PAGES         = {51--61},
  doi           = {https://dx.doi.org/10.1016/J.TCS.2013.11.023},
  dblp          = {https://dblp.org/rec/journals/tcs/DemaineDHUUU14},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1016/j.tcs.2013.11.023">ScienceDirect</A> and as
                   <A HREF="http://arXiv.org/abs/1003.2851">
                   arXiv:1003.2851</A>.},
  replaces      = {Uno_FUN2010},
  papers        = {Uno_FUN2010},
}

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.

Comments:

This paper is also available from ScienceDirect and as arXiv:1003.2851.

Availability:

The paper is available in PostScript (822k), gzipped PostScript (383k), and PDF (228k).

See information on file formats.

[Google Scholar search]

Related papers:

Uno_FUN2010 (UNO is hard, even for a single player)