Computing a perfect strategy for n × n chess requires time exponential in n
- 2 September 1981
- journal article
- Published by Elsevier BV in Journal of Combinatorial Theory, Series A
- Vol. 31 (2), 199-214
- https://doi.org/10.1016/0097-3165(81)90016-9
Abstract
No abstract availableKeywords
This publication has 4 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