Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090)
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: Computing a perfect strategy for nxn chess requires time exponential in n |
scientific article; zbMATH DE number 3733708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a perfect strategy for nxn chess requires time exponential in n |
scientific article; zbMATH DE number 3733708 |
Statements
Computing a perfect strategy for nxn chess requires time exponential in n (English)
0 references
1981
0 references
computing a perfect strategy
0 references
chess
0 references
nxn board
0 references
complete in exponential time
0 references
particular game
0 references
