Computing a perfect strategy for n×n chess requires time exponential in n
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 278-293
- https://doi.org/10.1007/3-540-10843-2_23
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Hex ist PSPACE-vollst ndigActa Informatica, 1981
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- Gobang ist PSPACE-vollständigActa Informatica, 1980
- Provably Difficult Combinatorial GamesSIAM Journal on Computing, 1979
- The complexity of checkers on an N × N boardPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978