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

From MaRDI portal
Revision as of 06:00, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
UNO is hard, even for a single player
scientific article

    Statements

    title
    UNO is hard, even for a single player (English)
    0 references
    author
    Erik D. Demaine
    0 references
    Martin L. Demaine
    0 references
    Nicholas J. A. Harvey
    0 references
    Ryuhei Uehara
    0 references
    Takeaki Uno
    0 references
    Yushi Uno
    0 references
    publication date
    22 January 2014
    0 references
    zbMATH Keywords
    algorithmic combinatorial game theory
    0 references
    dynamic programming
    0 references
    Hamiltonian path
    0 references
    mathematical puzzles/games
    0 references

    Identifiers

    Mathematics Subject Classification ID
    91A46
    0 references
    68Q17
    0 references
    05C45
    0 references
    91A10
    0 references
    91A12
    0 references
    zbMATH DE Number
    6248967
    0 references
    OpenAlex ID
    W2069939081
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q389942&oldid=35369327"
    Powered by MediaWiki