Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n.

Aviezri S. Fraenkel David Lichtenstein Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. 199-214 1981 31 J. Comb. Theory, Ser. A 2 db/journals/jct/jcta31.html#FraenkelL81