B. Audibert, J. Audibert, and S. Bubeck, Minimax policies for adversarial and stochastic bandits, 22th annual conference on learning theory, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00834882

. Boissac, . Cazenave, F. Boissac, and T. Cazenave, De nouvelles heuristiques de recherche appliques la rsolution d'Atarigo, Intelligence Artificielle et Jeux, pp.127-141, 2006.

C. Bouton, Nim, A Game with a Complete Mathematical Theory, Proceedings of BGA'2010. [Bouton, pp.35-39, 1901.
DOI : 10.2307/1967631

T. Cazenave, A Phantom-Go Program, ACG, pp.120-125, 2006.
DOI : 10.1007/11922155_9

. Cazenave, T. Borsboom-]-cazenave, and J. Borsboom, Golois wins phantom go tournament, ICGA Journal, vol.30, issue.3, pp.165-166, 2007.
DOI : 10.3233/icg-2009-32110

K. Grigoriadis, M. D. Grigoriadis, and L. G. Khachiyan, A sublinear-time randomized approximation algorithm for matrix games, Operations Research Letters, vol.18, issue.2, pp.53-58, 1995.
DOI : 10.1016/0167-6377(95)00032-0

K. Kryukov and . Littman, EGTs online An efficient algorithm for dynamic programming in partially observable markov decision processes, 1995.

R. Parr, R. Parr, S. Russell, and . Schaeffer, Approximating optimal policies for partially observable stochastic domains Checkers is solved Solving Ponnuki-Go on small boards, Proceedings of the International Joint Conference on Artificial Intelligence Proceedings of 14th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC'02), pp.347-354, 1995.