The Mate-in-n Problem of Infinite Chess Is Decidable (Q2904396): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1201.5597 / rank | |||
Normal rank |
Revision as of 09:37, 19 April 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