Title: Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n
Subjects: Chess, Data processing, Combinatorial analysis, Computational complexity, Game theory