1. Computing a perfect strategy for n × n chess requires time exponential in n;Fraenkel;J. Comb. Theory, Ser. A,1981
2. Complexity of retrograde and helpmate chess problems: even cooperative chess is hard;Brunner,2020
3. Winning Ways for Your Mathematical Plays;Berlekamp,2001
4. Pspace-hardness of some combinatorial games;Fraenkel;J. Comb. Theory, Ser. A,1987
5. The complexity of pursuit on a graph;Goldstein;Theor. Comput. Sci.,1995