B. «. Hendrik, Adaptive Playout Policies for Monte-Carlo Go ». Mém.de mast, Institut für Kognitionswissenschaft, 2010.

J. Basaldúa, S. Stewart, J. M. Moreno-vega, and P. Drake, Two Online Learning Playout Policies in Monte Carlo Go: An Application of Win/Loss States, IEEE Transactions on Computational Intelligence and AI in Games, vol.6, issue.1, pp.1-9, 2014.
DOI : 10.1109/TCIAIG.2013.2292565

B. Bruno and C. Tristan, « Computer Go : An AI oriented survey, Artificial Intelligence, vol.1321, issue.23, pp.39-103, 2001.

B. Sébastien and C. Nicolò, « Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems, Foundations and Trends® in Machine Learning, vol.51, pp.1-122, 2012.

P. [. Baier and . Drake, The Power of Forgetting: Improving the Last-Good-Reply Policy in Monte Carlo Go, IEEE Transactions on Computational Intelligence and AI in Games 2, pp.303-309, 2010.
DOI : 10.1109/TCIAIG.2010.2100396

B. Laurent, D. Eric, and G. Sylvain, « A survey about Solitaire Clobber, pp.18-189, 2013.

P. Baudi?, J. L. Gailly, and . Pachi, PACHI: State of the Art Open Source Go Program, Advances in Computer Games, pp.24-38, 2012.
DOI : 10.1007/978-3-642-31866-5_3

B. Bruno and H. Bernard, « Monte Carlo go developments, Advances in computer games, pp.159-174, 2004.

]. A. Bou+10, G. Bourki, M. Chaslot, and . Coulm, Scalability and Parallelization of Monte-Carlo Tree Search, Proceedings of Advance in Computer Games 13, 2010.

B. «. Bruno, Associating domain-dependent knowledge and Monte Carlo approaches within a Go program, Information Sciences, vol.175, issue.4, 2005.

]. C. Bro+12, E. Browne, D. Powley, and . Whitehouse, A Survey of Monte Carlo Tree Search Methods, Computational Intelligence and AI in Games, pp.1-43, 2012.

C. Tristan and . Search, Computational Intelligence and AI in Games, IEEE Transactions on, vol.41, pp.68-72, 2012.

E. Benjamin, . Childs, H. James, . Brodeur, and K. Levente, « Transpositions and move groups in Monte Carlo tree search, Computational Intelligence and Games CIG'08. IEEE Symposium On. IEEE, pp.389-395, 2008.

B. [. Cazenave and . Helmstetter, « Combining tactical search and Monte-Carlo in the game of Go, IEEE CIG, pp.171-175, 2005.

]. R. Cou07a and . Coulom, Computing Elo Ratings of Move Patterns in the Game of Go, Computer Games Workshop, pp.39-48, 2007.

]. R. Cou07b and . Coulom, « Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search, Computers and Games, pp.72-83, 2007.

C. Rémi, Criticality : a Monte-Carlo Heuristic for Go Programs Invited talk at the University of Electro-Communications, p.68, 2009.

E. D. Demaine, M. L. Demaine, F. Rudolf, . «-solitaire, and . Clobber, Algorithmic Combinatorial Game Theory, Theoretical Computer Science, vol.3133, pp.325-338, 2004.

D. Eric, G. Sylvain, and M. Julien, « New results about impartial solitaire clobber, Operations Research, vol.43, pp.463-482, 2009.

M. Madalina, . Drugan, and N. Ann, « Designing multi-objective multi-armed bandits algorithms : A study, Neural Networks (IJCNN) The 2013 International Joint Conference on. IEEE. 2013, pp.1-8

]. P. Dra09 and . Drake, « The Last-Good-Reply Policy for Monte-Carlo Go, International Computer Games Association Journal 32, pp.221-227, 2009.

M. Enzenberger, M. Muller, B. Arneson, R. Segal, and . Fuego-, Fuego—An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search, IEEE Transactions on Computational Intelligence and AI in Games 2, pp.259-270, 2009.
DOI : 10.1109/TCIAIG.2010.2083662

E. Markus, « Evaluation in Go by a Neural Network using Soft Segmentation, Advances in Computer Games : Many Games, Many Challenges, pp.97-108, 2003.

F. Hilmar and B. Yngvi, « Learning Simulation Control in General Game-Playing Agents, pp.954-959

]. S. Gel+06, Y. Gelly, R. Wang, O. Munos, and . Teytaud, Modification of UCT with Patterns in Monte-Carlo Go, Rapp. tech. INRIA, vol.46, pp.38-72, 2006.

]. S. Gel+12, L. Gelly, M. Kocsis, and . Schoenauer, The Grand Challenge of Computer Go : Monte Carlo Tree Search and Extensions, Communications of the ACM, vol.553, issue.12, pp.106-113, 2012.

G. «. Sylvain, Une contribution à l'apprentissage par renforcement, 2007.

G. Tobias and P. Marco, « Common fate graph patterns in Monte Carlo Tree Search for computer go, Computational Intelligence and Games (CIG), 2014 IEEE Conference on. Août 2014, pp.1-8

]. T. Gra+01, M. Graepel, M. Goutrie, R. Krüger, and . Herbrich, « Learning on Graphs in the Game of Go, In : Artificial Neural Networks?ICANN, pp.347-352, 2001.

D. [. Gelly and . Silver, Combining online and offline knowledge in UCT, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.273-280, 2007.
DOI : 10.1145/1273496.1273531

URL : https://hal.archives-ouvertes.fr/inria-00164003

D. [. Gelly and . Silver, Achieving master level play in 9× 9 computer go, Proceedings of AAAI, pp.1537-1540, 2008.

S. Gelly and D. Silver, Monte-Carlo tree search and rapid action value estimation in computer Go, Artificial Intelligence, vol.175, issue.11, p.68, 2011.
DOI : 10.1016/j.artint.2011.03.007

G. Tobias, L. Schaefers, and P. Marco, « On Semeai Detection in Monte-Carlo Go, Computers and Games, pp.14-25, 2014.

H. Michael, B. Terry, and S. Allan, « The Perceptual Cues that Reshape Expert Reasoning, Scientific Reports, vol.2, issue.6, 2012.

M. [. Huang, Investigating the Limits of Monte-Carlo Tree Search Methods in Computer Go, The 8th international conference on Computers and Games (CG2013). 2013, p.83
DOI : 10.1007/978-3-319-09165-5_4

A. [. Helmbold and . Parker-wood, All-Moves-As-First Heuristics in Monte- Carlo Go, Proceedings International Conference Artificial Intelligence, pp.605-610, 2009.

G. Mark, . Karpovsky, C. Krishnendu, and L. B. Levitin, « On a New Class of Codes for Identifying Vertices in Graphs, IEEE Transactions on Information Theory, vol.442, pp.599-611, 1998.

C. [. Kocsis and . Szepesvári, Bandit Based Monte-Carlo Planning, Machine Learning : ECML 2006, pp.282-293, 2006.
DOI : 10.1007/11871842_29

L. Leonardo, . De, and . Carvalho, « Représentations émergentes : Une approche multi-agents des systèmes complexes adaptatifs en psychologie cognitive, Thèse de doct. Université Lumière Lyon, p.6, 2008.

]. Y. Lec+98, L. Lecun, Y. Bottou, P. Bengio, and . Haffner, « Gradient-based learning applied to document recognition, Proceedings of the IEEE, pp.2278-2324, 1998.

L. Lukas, « Modeling Go Game as a Large Decomposable Decision Process

L. Michael and . Littman, « Markov Games as a Framework for Multi-Agent Reinforcement Learning, Proceedings of the Eleventh International Conference on Machine Learning, pp.157-163, 1994.

J. Richard, . Lorentz, and . Amazons-discover-monte-carlo, Computers and games, pp.13-24, 2008.

L. Édouard, In : La Nature Revue des sciences et de leurs applications aux arts et à l'industrie. Journal hebdomadaire illustré Suivi de : Bulletin météorologique de La Nature, Boîte aux lettres, Nouvelles scientifiques : Quinzième année, deuxième semestre : n. 731 à 756, pp.1887-402

M. Jean and C. Tristan, « Monte-Carlo Tree Search for General Game Playing, 2008.

M. Martin and . Fuego-gb, Prototype at the Human machine competition in Barcelona 2010 : a Tournament Report and Analysis, Rapp. tech. Deptartement of Computing Science Canada, vol.36, pp.29-83, 2010.

]. S. Pel+09, A. Pellegrino, J. Hubbard, P. Galbraith, Y. Drake et al., « Localizing Search in Monte-Carlo Go Using Statistical Covariance, ICGA Journal, vol.323, issue.69, pp.154-160, 2009.

J. Stuart, . Russel, and N. Peter, Artificial intelligence : a modern approach, 2010.

D. Christopher and . Rosin, « Nested rollout policy adaptation for Monte Carlo tree search, Proceedings of the Twenty-Second international joint conference on Artificial Intelligence-Volume Volume One, pp.649-654, 2011.

R. «. Lisa, Des récréations arithmétiques au corps des nombres surréels et à la victoire d'un programme aux échecs : une histoire de la théorie des jeux combinatoires au XXème siècle, Thèse de doct, p.2014

B. [. Ramanujan and . Selman, « Trade-Offs in Sampling-Based Adversarial Planning, pp.202-209

F. [. Rimmel and . Teytaud, Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search, Applications of Evolutionary Computation, vol.79, pp.201-210, 2010.
DOI : 10.1007/978-3-642-12239-2_21

URL : https://hal.archives-ouvertes.fr/inria-00456422

A. Rimmel, F. Teytaud, and O. Teytaud, Biasing Monte-Carlo Simulations through RAVE Values, Computers and Games, pp.59-68, 2011.
DOI : 10.1007/978-3-642-17928-0_6

URL : https://hal.archives-ouvertes.fr/inria-00485555

S. Jahn-takeshi, H. Mark, J. Winands, H. Uiterwijk, and H. Jaap-van-den, « Grouping nodes for Monte-Carlo tree search, Computer Games Workshop, pp.276-283, 2007.

S. Richard, . Sutton, G. Andrew, and . Barto, Reinforcement Learning : An Introduction, pp.11-51, 1998.

. D. Maartenp, M. M. Schadd, H. Winands, H. Jaap-van-den, G. J. et al., « Single-Player Monte-Carlo Tree Search, English. In : Computers and Games. Sous la dir. de H.Jaap van den HERIK, Xinhe XU, Zongmin MA et MarkH.M. WINANDS. T. 5131. Lecture Notes in Computer Science, pp.1-12, 2008.

S. Jonathan, The History Heuristic and Alpha-Beta Search Enhancements in Practice ». In : Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.1111, pp.1203-1212, 1989.

N. Nicol, . Schraudolph, D. Peter, J. Terrence, and . Sejnowski, Temporal Difference Learning of Position Evaluation in the Game of Go, Advances in Neural Information Processing Systems, pp.817-817, 1994.

B. Richard and . Segal, On the scalability of parallel UCT, Computers and Games, pp.36-47, 2011.

R. [. Stern, T. Herbrich, and . Graepel, Bayesian pattern ranking for move prediction in the game of Go, Proceedings of the 23rd international conference on Machine learning , ICML '06, pp.873-880, 2006.
DOI : 10.1145/1143844.1143954

S. Huang, « New Heuristics for Monte Carlo Tree Search Applied to the Game of Go, Thèse de doct, pp.1-40, 2011.

S. David, Reinforcement learning and simulation-based search in computer Go, Thèse de doct, pp.1-68, 2009.

R. S. Sutton, P. Doina, and S. Satinder, Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning, Artificial Intelligence, vol.112, issue.1-2, pp.1-2, 1999.
DOI : 10.1016/S0004-3702(99)00052-1

S. David, S. Richard, and M. Martin, « Reinforcement Learning of Local Shape in the Game of Go, Proceedings of the 20th International Joint Conference on Artifical Intelligence. IJCAI'07, pp.1053-1058, 2007.

R. [. Silver, M. Sutton, and . Müller, Temporal-difference search in computer Go, Machine Learning, vol.3, issue.1, pp.1-37, 2012.
DOI : 10.1007/s10994-012-5280-0

G. [. Silver and . Tesauro, Monte-Carlo simulation balancing, Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pp.945-952, 2009.
DOI : 10.1145/1553374.1553495

T. David and M. Martin, « Computational Experiments with the RAVE Heuristic, Computers and Games, pp.69-80, 2011.

M. J. Tak, M. H. Winands, and Y. Bjornsson, N-Grams and the Last-Good-Reply Policy Applied in General Game Playing, Computational Intelligence and AI in Games, pp.73-83, 2012.
DOI : 10.1109/TCIAIG.2012.2200252

V. Gabriel, . Eyck, and M. Martin, « Revisiting Move Groups in Monte-Carlo Tree Search, Advances in Computer Games, pp.13-23, 2012.

Y. Wang and S. Gelly, Modifications of UCT and sequence-like simulations for Monte-Carlo Go, 2007 IEEE Symposium on Computational Intelligence and Games, pp.175-182, 2007.
DOI : 10.1109/CIG.2007.368095

W. Weijia and S. Michele, « Multi-objective Monte-Carlo Tree Search, Asian conference on machine learning. T. 25. 2012, pp.507-522

B. Articles, F. André, A. Frédéric, D. Eric, and H. Salima, « A new selfacquired knowledge process for Monte Carlo Tree Search ». en, Computer Games Workshop, ECAI (European Conference on Artificial Intelligence). Août 2012, pp.13-24

F. André, A. Frédéric, D. Eric, and H. Salima, « Knowledge complement for Monte Carlo Tree Search : an application to combinatorial games ». en, IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp.997-1003, 2014.

F. André, A. Frédéric, D. Eric, and H. Salima, « A Self- Acquiring Knowledge Process for MCTS, International Journal on Artificial Intelligence Tools, pp.2015-87