A
Aviezri S. Fraenkel
4 works on record
Works
![Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n](https://covers.openlibrary.org/b/id/11853549-M.jpg)
Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
Combinatorial Games
Combinatorial Games
Adventures in Games and Computational Complexity
Adventures in Games and Computational Complexity
Computing a perfect strategy for n x n chess requires time exponential in n
Computing a perfect strategy for n x n chess requires time exponential in n