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

From MaRDI portal
Revision as of 08:59, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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