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

From MaRDI portal
Revision as of 00:22, 16 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56813209, #quickstatements; #temporary_batch_1708039061803)
scientific article
Language Label Description Also known as
English
The Mate-in-n Problem of Infinite Chess Is Decidable
scientific article

    Statements

    The Mate-in-n Problem of Infinite Chess Is Decidable (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2012
    0 references

    Identifiers