T. Cazenave, A Phantom-Go Program, Proceedings of Advances in Computer Games, pp.120-125, 2006.
DOI : 10.1007/11922155_9

M. Crasmaru, On the Complexity of Tsume-Go, Proceedings of the First International Conference on Computer Games, pp.222-231, 1998.
DOI : 10.1007/3-540-48957-6_15

M. Crasmaru and J. Tromp, Ladders are PSPACE-complete, Computers and Games, pp.241-249, 2000.

H. Everett, 2. RECURSIVE GAMES, Annals of Mathematical Studies AM, vol.339, pp.47-78, 1957.
DOI : 10.1515/9781400882151-004
URL : https://hal.archives-ouvertes.fr/inria-00103926

D. Lichtenstein and M. Sipser, GO Is Polynomial-Space Hard, Journal of the ACM, vol.27, issue.2, pp.393-401, 1980.
DOI : 10.1145/322186.322201

O. Madani, S. Hanks, and A. Condon, On the undecidability of probabilistic planning and related stochastic optimization problems, Artificial Intelligence, vol.147, issue.1-2, pp.5-34, 2003.
DOI : 10.1016/S0004-3702(02)00378-8

J. Nash, Some games and machines for playing them, 1952.

A. Paz, Introduction to probabilistic automata, 1971.

E. L. Post, Recursively enumerable sets of positive integers and their decision problems . Bulletin of the, pp.284-316, 1944.

J. M. Robson, The complexity of go, IFIP Congress, pp.413-417, 1983.

O. Teytaud, Artificial Intelligence with parallelism, with Applications to Games, Planning and Optimization, 2011.