1. Bouton, C.L.: Nim, a game with a complete mathematical theory. Annals of Mathematics 3, 35–39 (1901/2002)
2. Conway, J.H.: On Numbers and Games. Academic Press, London (1976)
3. Cormode, G.: The Hardness of the Lemmings Game, or Oh no, more NP-Completeness Proofs. In: Proceedings of Third International Conference on Fun with Algorithms, pp. 65–76 (2004)
4. Culbertson, J.: Sokoban is PSPACE-complete. In: Proceedings of the International Conference on Fun with Algorithms, pp. 65–76 (1998)
5. Demaine, E.D., Hearn, R.A.: Constraint logic: A uniform framework for modeling computation as games. In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (2008)