An upper bound for the number of chess diagrams without promotion (Q6385969)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound for the number of chess diagrams without promotion |
scientific article; zbMATH DE number 900497037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the number of chess diagrams without promotion |
scientific article; zbMATH DE number 900497037 |
Statements
17 December 2021
0 references
cs.GT
0 references
math.CO
0 references
