Aviezri S. Fraenkel

• Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
• Adventures in Games and Computational Complexity
• Combinatorial Games
• Computing a perfect strategy for n x n chess requires time exponential in n