The Complexity of Escaping Labyrinths and Enchanted Forests. (Q3301022)

From MaRDI portal
Revision as of 09:15, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Escaping Labyrinths and Enchanted Forests.
scientific article

    Statements

    author
    Florian D. Schwahn
    0 references
    Clemens Thielen
    0 references
    publication date
    11 August 2020
    0 references
    zbMATH Keywords
    board games
    0 references
    combinatorial game theory
    0 references
    computational complexity
    0 references
    Labyrinth
    0 references
    Enchanted Forest
    0 references
    title
    The Complexity of Escaping Labyrinths and Enchanted Forests. (English)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    91A46
    0 references
    zbMATH DE Number
    7229774
    0 references
    OpenAlex ID
    W2808831986
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3301022&oldid=37039895"
    Powered by MediaWiki