The Mate-in-n Problem of Infinite Chess Is Decidable (Q2904396): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56813209, #quickstatements; #temporary_batch_1708039061803 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q56813209 / rank | |||
Normal rank |
Revision as of 00:22, 16 February 2024
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
14 August 2012
0 references