![](/img/cover-not-exists.png)
Computing a perfect strategy for n × n chess requires time exponential in n
Aviezri S Fraenkel, David LichtensteinVolume:
31
Year:
1981
Language:
english
Pages:
16
DOI:
10.1016/0097-3165(81)90016-9
File:
PDF, 913 KB
english, 1981