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

From MaRDI portal
Revision as of 16:38, 22 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(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

    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