E. Berlekamp, J. H. Conway, and R. K. Guy, Winning ways for your mathematical plays, 2001.

K. Burke and . Blog, http://combinatorialgametheory.blogspot.fr/ search?updated-max=2012-10-05T10, pp.0-0700, 2012.

N. Butko, K. A. Lehmann, and V. Ramenzoni, Ricochet Robots -A Case Study for Human Complex Problem Solving, from the Complex System Summer School, 2006.

E. Demaine, Playing games with algorithms: Algorithmic combinatorial game theory, Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, 2001.

B. Engels and T. Kamphans, On the complexity of Randolph's Robot Game, 2005.

D. Gonçalves, A. Pinlou, M. Rao, and S. Thomassé, The Domination Number of Grids, SIAM Journal on Discrete Mathematics, vol.25, issue.3, pp.1443-1453, 2011.
DOI : 10.1137/11082574

J. R. Hartline and R. Libeskind-hadas, The Computational Complexity of Motion Planning, SIAM Review, vol.45, issue.3, pp.543-557, 2003.
DOI : 10.1137/S003614450139517

M. Hock, Exploring the complexity of the ufo puzzle, Undergraduate thesis, 2001.

A. Klobucar, Total domination numbers of cartesian products, Mathematical Communications, vol.9, pp.35-44, 2004.

J. C. Latombe, Robot Motion Planning [11] TCS questions & answers Website (2012) http://cstheory.stackexchange.com/questions/10813/ what-is-the-known-complexity-of-this-game-similar-to-pushpush-1, 1991.