The Mate-in-n Problem of Infinite Chess Is Decidable (Q2904396)

From MaRDI portal
Revision as of 22:19, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/cie/BrumleveHS12, #quickstatements; #temporary_batch_1731530891435)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Mate-in-n Problem of Infinite Chess Is Decidable
scientific article

    Statements

    title
    The Mate-in-n Problem of Infinite Chess Is Decidable (English)
    0 references
    author
    Dan Brumleve
    0 references
    Joel David Hamkins
    0 references
    Philipp Schlicht
    0 references
    publication date
    14 August 2012
    0 references

    Identifiers

    zbMATH DE Number
    6065517
    0 references
    Wikidata QID
    Q56813209
    0 references
    OpenAlex ID
    W1893952159
    0 references
    arXiv ID
    1201.5597
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2904396&oldid=37910477"
    Powered by MediaWiki