The Mate-in-n Problem of Infinite Chess Is Decidable (Q2904396)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6065517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Mate-in-n Problem of Infinite Chess Is Decidable |
scientific article; zbMATH DE number 6065517 |
Statements
The Mate-in-n Problem of Infinite Chess Is Decidable (English)
0 references
14 August 2012
0 references
0.82228965
0 references
0.81832564
0 references
0.8069594
0 references
0.8042375
0 references
0 references
