A. Menif, C. Guettier, and T. Cazenave, Planning and execution control architecture for infantry serious gaming, Planning in Games Workshop, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01593608

J. Neumann, Zur Theorie der Gesellschaftsspiele, Mathematische Annalen, vol.100, issue.1, pp.295-320, 1928.
DOI : 10.1007/BF01448847

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

B. , Computing equilibria for two-person games, Handbook of Game Theory, pp.1723-1759, 2002.

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

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite time analysis of the multiarmed bandit problem, Machine Learning, pp.235-256, 2002.

M. Mundhenk, J. Goldsmith, C. Lusena, and E. Allender, Complexity of finite-horizon Markov decision process problems, Journal of the ACM, vol.47, issue.4, pp.681-720, 2000.
DOI : 10.1145/347476.347480

J. Rintanen, Complexity of planning with partial observability, ICAPS, pp.345-354, 2004.

D. Auger, Proceedings, Part I Multiple Tree for Partially Observable Monte-Carlo Tree Search, pp.53-62, 2011.

D. Auger and O. Teytaud, THE FRONTIER OF DECIDABILITY IN PARTIALLY OBSERVABLE RECURSIVE GAMES, International Journal of Foundations of Computer Science, vol.23, issue.07, pp.1439-1450, 2012.
DOI : 10.1090/S0002-9904-1944-08111-1

URL : https://hal.archives-ouvertes.fr/hal-00710073

A. Saffidine, O. Teytaud, and S. Yen, Go Complexities, Advances in Computer Games, ser. Advances in Computer Games
DOI : 10.1145/322186.322201

URL : https://hal.archives-ouvertes.fr/hal-01256660

Y. Wang, J. Audibert, and R. Munos, Infinitely many-armed bandits, Proceedings of Advances in Neural Information Processing Systems, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00830178

D. Robilliard and C. Fonlupt, Towards human-competitive game playing for complex board games with genetic programming, " in Artificial Evolution 2015, ser, EA2015), 2015.

J. B. Pollack and A. D. Blair, Co-evolution in the successful learning of backgammon strategy, Machine Learning, pp.225-2401007417214905

W. Ja´skowskija´skowski and M. Szubert, Coevolutionary CMA-ES for Knowledge-Free Learning of Game Position Evaluation, IEEE Transactions on Computational Intelligence and AI in Games, vol.8, issue.4, pp.389-401, 2016.
DOI : 10.1109/TCIAIG.2015.2464711

C. E. Bonferroni, V. Mnih, C. Szepesvári, and J. Audibert, Teoria statistica delle classi e calcolo delle probabilità Empirical bernstein stopping, Proceedings of the 25th Annual International Conference on Machine Learning, pp.3-62, 1936.

I. Rechenberg, Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, ser. Problemata. Stuttgart- Bad Cannstatt: Frommann-Holzboog, 1973.

S. A. Kauffman, Escaping the red queen effect, The McKinsey Quarterly, issue.1, pp.118-130, 1995.

L. Van-valen, A new evolutionary law Evolutionary Theory, pp.1-30, 1973.

P. Collet, E. Lutton, F. Raynal, and M. Schoenauer, Polar IFS+Parisian Genetic Programming=Efficient IFS Inverse Problem Solving Available: https://doi.org/10, Genetic Programming and Evolvable Machines, vol.1, issue.4, pp.339-3611010065123132, 1023.
DOI : 10.1023/A:1010065123132

D. L. St-pierre, J. Hoock, J. Liu, F. Teytaud, and O. Teytaud, Automatically reinforcing a game AI, 2016.

T. Cazenave, J. Liu, and O. Teytaud, The rectangular seeds of domineering Available: https, 2015 IEEE Conference on Computational Intelligence and Games, pp.530-531, 2015.
DOI : 10.1109/cig.2015.7317904

T. Cazenave, J. Liu, F. Teytaud, and O. Teytaud, Learning opening books in partially observable games: Using random seeds in Phantom Go, 2016 IEEE Conference on Computational Intelligence and Games (CIG), pp.1-7, 2016.
DOI : 10.1109/CIG.2016.7860389

URL : https://hal.archives-ouvertes.fr/hal-01413229

J. Liu, O. Teytaud, and T. Cazenave, Fast Seed-Learning Algorithms for Games, Computers and Games -9th International Conference, pp.58-70, 2016.
DOI : 10.1007/978-3-319-05428-5_8

V. Ventos, Y. Costel, O. Teytaud, and S. T. Ventos, Boostring a bridge artificial intelligence, International Conference on Tools with Artificial Intelligence, pp.1280-1287, 2017.

M. Nica, OPTIMAL STRATEGY IN ???GUESS WHO????: BEYOND BINARY SEARCH, Probability in the Engineering and Informational Sciences (accepted), 2015. [Online]. Available
DOI : 10.1214/aoap/1177005360

URL : http://arxiv.org/pdf/1509.03327

E. Lakshtanov and V. Roshchina, On Finiteness in the Card Game of War, The American Mathematical Monthly, vol.119, issue.4, pp.318-323, 2012.
DOI : 10.4169/amer.math.monthly.119.04.318

A. E. Elo, The rating of chessplayers, past and present Available: http://www.amazon.com/ Rating-Chess-Players-Past-Present, p.668047216, 1978.