Computing a perfect strategy for n × n chess requires time...

Computing a perfect strategy for n × n chess requires time exponential in n

Aviezri S Fraenkel, David Lichtenstein
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
31
Year:
1981
Language:
english
Pages:
16
DOI:
10.1016/0097-3165(81)90016-9
File:
PDF, 913 KB
english, 1981
Conversion to is in progress
Conversion to is failed