Hanabi is NP-hard, even for cheaters who look at their cards (Q528493)

From MaRDI portal
Revision as of 20:34, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hanabi is NP-hard, even for cheaters who look at their cards
scientific article

    Statements

    Hanabi is NP-hard, even for cheaters who look at their cards (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    algorithmic combinatorial game theory
    0 references
    computational complexity
    0 references
    solitaire games
    0 references
    sorting
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references