1. Winning Ways for Your Mathematical Plays;Berlekamp,2001
2. Complexity of path-forming games;Bodlaender;Theoret. Comput. Sci.,1993
3. Nim, a game with a complete mathematical theory;Bouton;Ann. of Math.,1901
4. The shortest path game: Complexity and algorithms;Darmann,2014
5. Computing a perfect strategy for n× n chess requires time exponential in n;Fraenkel,1981