N by N Checkers is Exptime Complete
- 1 May 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (2) , 252-267
- https://doi.org/10.1137/0213018
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- GO Is Polynomial-Space HardJournal of the ACM, 1980
- Classes of Pebble Games and Complete ProblemsSIAM Journal on Computing, 1979
- Provably Difficult Combinatorial GamesSIAM Journal on Computing, 1979