Aviezri Fraenkel; D. Lichtenstein (1981), "Computing a perfect strategy for n×n chess requires time exponential in n", J. Combin.
Aviezri Fraenkel, D. Lichtenstein: Computing a perfect strategy for n×n chess requires time exponential in n. In: J. Comb.