Q6065414 (Q6065414): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computing a perfect strategy for nxn chess requires time exponential in n / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3395518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Diameter of Chess Grows Exponentially / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of chess / rank | |||
Normal rank |
Latest revision as of 13:43, 3 August 2024
scientific article; zbMATH DE number 7765375
Language | Label | Description | Also known as |
---|---|---|---|
English | No label defined |
scientific article; zbMATH DE number 7765375 |
Statements
14 November 2023
0 references
hardness
0 references
board games
0 references
PSPACE
0 references