25,161
edits
Changes
Created page with "'''Home * Search * Monte-Carlo Tree Search''' FILE:Edvard Munch - At the Roulette Table in Monte Carlo - Google Art Project.jpg|border|right|thumb|[[Arts#..."
'''[[Main Page|Home]] * [[Search]] * Monte-Carlo Tree Search'''
[[FILE:Edvard Munch - At the Roulette Table in Monte Carlo - Google Art Project.jpg|border|right|thumb|[[Arts#Munch|Edvard Munch]] - At the Roulette Table in Monte Carlo <ref>[[Arts#Munch|Edvard Munch]], [https://en.wikipedia.org/wiki/File:Edvard_Munch_-_At_the_Roulette_Table_in_Monte_Carlo_-_Google_Art_Project.jpg At the Roulette Table in Monte Carlo, 1893], [https://en.wikipedia.org/wiki/Edvard_Munch Edvard Munch from Wikipedia]</ref> ]]
'''Monte Carlo Tree Search''', (Monte-Carlo Tree Search, MCTS)<br/>
is a [[Best-First|Best-First search]] algorithm based on [https://en.wikipedia.org/wiki/Randomness random] playouts. In conjunction with [[UCT]] ('''U'''pper '''C'''onfidence bounds applied to '''T'''rees) Monte-Carlo Tree Search has yielded in a breakthrough in [[Go|Computer Go]] <ref>[[Rémi Coulom]] ('''2009'''). ''The Monte-Carlo Revolution in Go''. JFFoS'2008: Japanese-French Frontiers of Science Symposium, [http://remi.coulom.free.fr/JFFoS/JFFoS.pdf slides as pdf]</ref>, and is also successful in [[Amazons]] <ref>[[Julien Kloetzer]], [[Hiroyuki Iida]], [[Bruno Bouzy]] ('''2007'''). ''The Monte-Carlo approach in Amazons''. [[CGW 2007]]</ref> <ref>[[Richard J. Lorentz]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_2 Amazons Discover Monte-Carlo]''. [[CG 2008]]</ref>, [[Lines of Action]] <ref>[[Mark Winands]] and [[Yngvi Björnsson]] ('''2009'''). ''Evaluation Function Based Monte-Carlo LOA''. [http://www.ru.is/faculty/yngvi/pdf/WinandsB09.pdf pdf]</ref>, [[Havannah]] <ref>[[Richard J. Lorentz]] ('''2010'''). ''[http://www.springerlink.com/content/p4x16832317r1214/ Improving Monte-Carlo Tree Search in Havannah]''. [[CG 2010]]</ref>, [[Hex]] <ref>[[Broderick Arneson]], [[Ryan Hayward]], [[Philip Henderson]] ('''2010'''). ''Monte Carlo Tree Search in Hex''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://webdocs.cs.ualberta.ca/~hayward/papers/mcts-hex.pdf pdf]</ref>, [[Checkers]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=38554 UCT surprise for checkers !] by [[Daniel Shawul]], [[CCC]], March 25, 2011</ref> and other [[Games]] with some difficulties in position evaluation, but until December 2017, when a [[Google]] [[DeepMind]] team reported on [[AlphaZero]] <ref>[[David Silver]], [[Thomas Hubert]], [[Julian Schrittwieser]], [[Ioannis Antonoglou]], [[Matthew Lai]], [[Arthur Guez]], [[Marc Lanctot]], [[Laurent Sifre]], [[Dharshan Kumaran]], [[Thore Graepel]], [[Timothy Lillicrap]], [[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://arxiv.org/abs/1712.01815 arXiv:1712.01815]</ref>, not for [[Chess]] <ref>[[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010]</ref> <ref>[[Oleg Arenz]] ('''2012'''). ''[http://www.ke.tu-darmstadt.de/bibtex/publications/show/2321 Monte Carlo Chess]''. B.Sc. thesis, [[Darmstadt University of Technology]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2012/Arenz_Oleg.pdf pdf]</ref>.
MCTS is based on randomized explorations of the [[Search Space|search space]]. Using the results of previous explorations, the algorithm gradually grows a [[Search Tree|game tree]] in [[Memory|memory]], and successively becomes better at accurately estimating the values of the most promising moves <ref>[[Guillaume Chaslot]], [[Mark Winands]], [[Jaap van den Herik]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_6 Parallel Monte-Carlo Tree Search]''. [[CG 2008]], [https://dke.maastrichtuniversity.nl/m.winands/documents/multithreadedMCTS2.pdf pdf]</ref>.
=Four Phases=
MCTS consists of four strategic phases, repeated as long as there is time left <ref>[[Guillaume Chaslot]], [[Mark Winands]], [[Jaap van den Herik]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_6 Parallel Monte-Carlo Tree Search]''. [[CG 2008]], [https://dke.maastrichtuniversity.nl/m.winands/documents/multithreadedMCTS2.pdf pdf]</ref> :
# In the '''Selection''' phase the tree is traversed from the [[Root|root node]] until it selects a [[Leaf Node|leaf node]] that is not added to the tree yet
# The '''Expansion''' strategy adds the leaf node to the tree
# The '''Simulation''' strategy plays moves in self-play until the end of the game. The result is either 1, 0 ,-1
# The '''Backpropagation''' strategy propagates the results through the tree
[[FILE:MCTS (English).svg|none|border|text-bottom]]
Steps of Monte Carlo Tree Search <ref>[https://commons.wikimedia.org/wiki/File:MCTS_%28English%29.svg Steps of Monte-Carlo Tree Search] by Mciura, March 31, 2013, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Monte_Carlo_tree_search Monte Carlo tree search from Wikipedia]</ref>
<span id="PureMCS"></span>
=Pure Monte-Carlo search=
'''Pure Monte-Carlo search''' with parameter T means that for each feasible move T random games are generated. The move with the best average score is played. A game is called “Monte Carlo perfect” when this procedure converges to perfect play for each position, when T goes to infinity. However, with limited time per move, increasing T does not guarantee to find a better move <ref>[[Ingo Althöfer]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-31866-5_22 On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness]''. [[Advances in Computer Games 13]]</ref>.
=UCT=
[[UCT]] ('''U'''pper '''C'''onfidence bounds applied to '''T'''rees) deals with the flaw of Monte-Carlo Tree Search, when a program may favor a losing move with only one or a few forced refutations, but due to the vast majority of other moves provides a better random playout score than other, better moves <ref>[[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]</ref>.
=See also=
* [[Deep Learning]]
* [[MCαβ]]
* [[Jakob Erdmann#UCT|MC and UCT poster]] by [[Jakob Erdmann]]
* [[Bojun Huang#Rollout|Rollout Paradigm]]
* [[Raghuram Ramanujan#UCT|Sampling-Based Planning]]
* [[Simulated Annealing]]
* [[UCT]]
=Publications=
==1987==
* [[Bruce Abramson]], [[Richard Korf]] ('''1987'''). ''A Model of Two-Player Evaluation Functions.'' [http://www.aaai.org/Conferences/AAAI/aaai87.php AAAI-87]. [http://www.aaai.org/Papers/AAAI/1987/AAAI87-016.pdf pdf]
==1990 ...==
* [[Bruce Abramson]] ('''1990'''). ''[http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=44404 Expected-Outcome: A General Model of Static Evaluation]''. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(2): 182-193.
* [[Bruce Abramson]] ('''1990'''). ''An Analysis of Expected-Outcome.'' Journal of Experimental and Theoretical Artificial Intelligence 2: 55-73.
* [[Bruce Abramson]] ('''1991'''). ''The Expected-Outcome Model of Two-Player Games.'' Part of the series, Research Notes in Artificial Intelligence (San Mateo: Morgan Kaufmann, 1991).
* [[Bernd Brügmann]] ('''1993'''). ''Monte Carlo Go''. [http://www.ideanest.com/vegos/MonteCarloGo.pdf pdf]
==2000 ...==
* [[Bruno Bouzy]], [[Bernard Helmstetter]] ('''2003'''). ''Monte Carlo Go Developments''. [[Advances in Computer Games 10]], [http://www.ai.univ-paris8.fr/~bh/articles/acg10-mcgo.pdf pdf]
* [[Bruno Bouzy]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_5 Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go]''. [[CG 2004]]
* [[Tristan Cazenave]] ('''2004'''). ''Monte Carlo Real Time Strategy''. [http://www.lamsade.dauphine.fr/~cazenave/papers/poster-mcrts.pdf pdf]
==2005 ...==
* [[Tristan Cazenave]], [[Bernard Helmstetter]] ('''2005'''). ''Combining tactical search and Monte-Carlo in the game of Go''. IEEE [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2005.html#CazenaveH05 CIG 2005], [http://www.ai.univ-paris8.fr/~bh/articles/searchmcgo.pdf pdf], [http://www.lamsade.dauphine.fr/~cazenave/papers/searchmcgo.pdf pdf]
* [[Bruno Bouzy]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_8 Move-Pruning Techniques for Monte-Carlo Go]''. [[Advances in Computer Games 11]]
* [[Bruno Bouzy]] ('''2005'''). ''Associating domain-dependent knowledge and Monte Carlo approaches within a go program''. Information Sciences, Heuristic Search and Computer Game Playing IV
'''2006'''
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]
* [[Sylvain Gelly]], [[Yizao Wang]] ('''2006'''). ''Exploration exploitation in Go: UCT for Monte-Carlo Go''. [http://www.lri.fr/%7Egelly/paper/nips_exploration_exploitation_mogo.pdf pdf]
* [[Sylvain Gelly]], [[Yizao Wang]], [[Rémi Munos]], [[Olivier Teytaud]] ('''2006'''). ''Modification of UCT with Patterns in Monte-Carlo Go''. [http://hal.inria.fr/inria-00117266 INRIA]
* [[Levente Kocsis]], [[Csaba Szepesvári]], [[Jan Willemson]] ('''2006'''). ''Improved Monte-Carlo Search''. [http://www.sztaki.hu/~szcsaba/papers/cg06-ext.pdf pdf]
* [[Jahn-Takeshi Saito]], [[Guillaume Chaslot]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_5 Monte-Carlo Proof-Number Search for Computer Go]''. [[CG 2006]]
* [[Rémi Coulom]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_7 Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search]''. [[CG 2006]]
* [[Bruno Bouzy]] ('''2006'''). ''History and Territory Heuristics for Monte-Carlo Go''. New Mathematics and Natural Computation
* [[Haruhiro Yoshimoto]], [[Kazuki Yoshizoe]], [[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Kenjiro Taura]] ('''2006'''). ''[http://dl.acm.org/citation.cfm?id=1597359 Monte Carlo Go Has a Way to Go]''. [http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai2006.html#YoshimotoYKKT06 AAAI 2006], [http://www.aaai.org/Papers/AAAI/2006/AAAI06-168.pdf pdf]
'''2007'''
* [[Rémi Coulom]] ('''2007'''). ''[http://remi.coulom.free.fr/Hakone2007/ Monte-Carlo Tree Search in Crazy Stone]''. [http://remi.coulom.free.fr/Hakone2007/Hakone.pdf slides as pdf]
* [[Yizao Wang]], [[Sylvain Gelly]] ('''2007'''). ''Modifications of UCT and Sequence-Like Simulations for Monte-Carlo Go''. IEEE Symposium on Computational Intelligence and Games, Honolulu, USA, 2007, [http://www.stat.lsa.umich.edu/%7Eyizwang/publications/wang07modifications.pdf pdf]
* [[Shugo Nakamura]], [[Makoto Miwa]], [[Takashi Chikayama]] ('''2007'''). ''Improvement of UCT using evaluation function''. [http://www.computer-shogi.org/gpw/gpw12_e.html 12th Game Programming Workshop 2007]
* [[Keh-Hsun Chen|Ken Chen]], [[Peigang Zhang]] ('''2007'''). ''Monte-Carlo Go with Knowledge-Guided Simulations''. [[CGW 2007]]
* [[Tristan Cazenave]] ('''2007'''). ''Reflexive Monte-Carlo Search''. [[CGW 2007]], [http://www.lamsade.dauphine.fr/~cazenave/papers/reflexmc.pdf pdf]
* [[François van Lishout]], [[Guillaume Chaslot]], [[Jos Uiterwijk]] ('''2007'''). ''[https://www.researchgate.net/publication/228378473_Monte-Carlo_tree_search_in_backgammon Monte-Carlo Tree Search in Backgammon]''. [[CGW 2007]]
* [[Julien Kloetzer]], [[Hiroyuki Iida]], [[Bruno Bouzy]] ('''2007'''). ''The Monte-Carlo approach in Amazons''. [[CGW 2007]]
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2007'''). ''On the Parallelization of UCT''. [[CGW 2007]], [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelUCT.pdf pdf]
* [[Jahn-Takeshi Saito]], [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2007'''). ''Grouping Nodes for Monte-Carlo Tree Search''. [[CGW 2007]]
* [[Tristan Cazenave]] ('''2007'''). ''Evolving Monte-Carlo Tree Search Algorithms''. [http://www.lamsade.dauphine.fr/~cazenave/papers/evolveMC.pdf pdf]
* [[Pim Nijssen]] ('''2007'''). ''Playing Othello Using Monte Carlo''. Bachelor's Thesis, [[Maastricht University]], [http://www.personeel.unimaas.nl/pim.nijssen/pub/bsc.pdf pdf]
'''2008'''
* [[Keh-Hsun Chen|Ken Chen]], [[Peigang Zhang]] ('''2008'''). ''Monte-Carlo Go with Knowledge-Guided Simulations''. [[ICGA Journal#31_2|ICGA Journal, Vol. 31, No. 2]]
* [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]], [http://fr.linkedin.com/pub/yann-kalemkarian/7/7aa/716 Yann Kalemkarian] ('''2008'''). ''The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning''. ICINCO-ICSO 2008: 244-249, [http://hal.archives-ouvertes.fr/docs/00/28/78/67/PDF/icin08.pdf pdf], [http://www.lri.fr/%7Eteytaud/UCTpara.pdf slides as pdf]
* [[Guillaume Chaslot]], [[Louis Chatriot]], [[Christophe Fiter]], [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Julien Pérez]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2008'''). ''Combining expert, offline, transient and online knowledge in Monte-Carlo exploration''. [http://www.lri.fr/%7Eteytaud/eg.pdf pdf]
* [[Guillaume Chaslot]], [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]], [[Bruno Bouzy]] ('''2008'''). ''Progressive Strategies for Monte-Carlo Tree Search''. [http://www.worldscinet.com/nmnc/nmnc.shtml New Mathematics and Natural Computation], Vol. 4, No. 3, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.3015&rep=rep1&type=pdf pdf] <ref>[[Jeff Rollason]] ('''2015'''). ''[http://www.aifactory.co.uk/newsletter/2015_02_mixing_immiscible.htm Mixing the Immiscible - MCTS and evaluation]''. [[AI Factory]], October 2015</ref>
* [[Guillaume Chaslot]], [[Sander Bakkes]], [[István Szita]] and [[Pieter Spronck]] ('''2008'''). ''Monte-Carlo Tree Search: A New Framework for Game AI''. [http://sander.landofsand.com/publications/AIIDE08_Chaslot.pdf pdf]
* [[Guillaume Chaslot]], [[Mark Winands]], [[István Szita]], and [[Jaap van den Herik]]. ('''2008'''). ''Cross-entropy for Monte-Carlo Tree Search''. [[ICGA Journal#31_3|ICGA Journal, Vol. 31, No. 3]], [http://www.personeel.unimaas.nl/m-winands/documents/crossmc.pdf pdf]
* [[Maarten Schadd]], [[Mark Winands]], [[Jaap van den Herik]], [[Huib Aldewereld]] ('''2008'''). ''Addressing NP-Complete Puzzles with Monte-Carlo Methods''. In Volume 9: Proceedings of the AISB 2008 Symposium on Logic and the Simulation of Interaction and Reasoning, pages 55-61, Brighton, UK, 2008. The Society for the study of Artificial Intelligence and Simulation of Behaviour. [http://www.personeel.unimaas.nl/Maarten-Schadd/Papers/2008SameGameAISB.pdf pdf]
* [[Maarten Schadd]], [[Mark Winands]], [[Jaap van den Herik]], [[Guillaume Chaslot]], [[Jos Uiterwijk]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_1 Single-Player Monte-Carlo Tree Search]''. [[CG 2008]], [http://www.personeel.unimaas.nl/Maarten-Schadd/Papers/2008SameGameCG.pdf pdf]
* [[Richard J. Lorentz]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_2 Amazons Discover Monte-Carlo]''. [[CG 2008]]
* [[Mark Winands]], [[Yngvi Björnsson]], [[Jahn-Takeshi Saito]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_3 Monte-Carlo Tree Search Solver]''. [[CG 2008]], [http://www.ru.is/faculty/yngvi/pdf/WinandsBS08.pdf pdf]
* [[Nathan Sturtevant]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_4 An Analysis of UCT in Multi-player Games]''. [[CG 2008]]
* [[Guillaume Chaslot]], [[Mark Winands]], [[Jaap van den Herik]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_6 Parallel Monte-Carlo Tree Search]''. [[CG 2008]], [https://dke.maastrichtuniversity.nl/m.winands/documents/multithreadedMCTS2.pdf pdf]
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_7 A Parallel Monte-Carlo Tree Search Algorithm]''. [[CG 2008]], [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelMCTS.pdf pdf]
* [[Keh-Hsun Chen|Ken Chen]], [[Dawei Du]], [[Peigang Zhang]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_9 A Fast Indexing Method for Monte-Carlo Go]''. [[CG 2008]]
* [[Yizao Wang]], [[Jean-Yves Audibert]], [[Rémi Munos]] ('''2008'''). ''Algorithms for Infinitely Many-Armed Bandits''. Advances in Neural Information Processing Systems, [http://www.stat.lsa.umich.edu/%7Eyizwang/publications/wang08algorithms.pdf pdf], Supplemental material - [http://www.stat.lsa.umich.edu/%7Eyizwang/publications/wang08algorithmsSupp.pdf pdf]
* [http://en.scientificcommons.org/james_h_brodeur James H. Brodeur], [http://en.scientificcommons.org/benjamin_e_childs Benjamin E. Childs] and [[Levente Kocsis]] ('''2008'''). ''Transpositions and Move Groups in Monte Carlo Tree Search.'' [http://eprints.pascal-network.org/archive/00004571/01/8057.pdf pdf]
* [[Hilmar Finnsson]] and [[Yngvi Björnsson]]. ('''2008'''). ''Simulation-Based Approach to General Game Playing.'' In The Twenty-Third AAAI Conference on Artificial Intelligence, [[AAAI]] Press, 2008. Accepted. [http://www.ru.is/faculty/yngvi/pdf/FinnssonB08a.pdf pdf], [http://www.aaai.org/Papers/AAAI/2008/AAAI08-041.pdf pdf] » [[General Game Playing]]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Monte-Carlo Tree Search for General Game Playing''. [http://www.lamsade.dauphine.fr/~cazenave/papers/ggp2008.pdf pdf] » [[General Game Playing]]
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2008'''). ''A Parallel Monte-Carlo Tree Search Algorithm''. [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelMCTS.pdf pdf]
* [[Ingo Althöfer]] ('''2008'''). ''On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations''. Technical Report, [http://www.althofer.de/mc-laziness.pdf pdf]
* [[Kazutomo Shibahara]], [[Yoshiyuki Kotani]] ('''2008'''). ''Combining Final Score with Winning Percentage using Sigmoid Function in Monte-Carlo Algorithm''. [[Conferences#GPW|13th Game Programming Workshop]], [http://www.csse.uwa.edu.au/cig08/Proceedings/papers/8016.pdf pdf]
* [[Shogo Takeuchi]], [[Tomoyuki Kaneko]], [[Kazunori Yamaguchi]] ('''2008'''). ''Evaluation of Monte Carlo tree search and the application to Go''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2008.html CIG 2008]
'''2009'''
* [[Jean-Yves Audibert]], [[Rémi Munos]], [[Csaba Szepesvári]] ('''2009'''). ''Exploration-exploitation trade-off using variance estimates in multi-armed bandits''. Theoretical Computer Science, 410:1876-1902, 2009, [http://www.ualberta.ca/%7Eszepesva/papers/ucbtuned-journal.pdf pdf]
* [[Guillaume Chaslot]], [[Christophe Fiter]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2009'''). ''Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search''. [[Advances in Computer Games 12]], [http://www.personeel.unimaas.nl/g-chaslot/papers/acg09.pdf pdf], [http://www.lri.fr/%7Erimmel/publi/EK_explo.pdf pdf]
* [[Guillaume Chaslot]], [[Jean-Baptiste Hoock]], [[Julien Pérez]], [[Arpad Rimmel]], [[Olivier Teytaud]], [[Mark Winands]] ('''2009'''). ''Meta Monte-Carlo Tree Search for Automatic Opening Book Generation''. [http://www.personeel.unimaas.nl/m-winands/documents/ouvertures9x9.pdf pdf]
* [[Markus Enzenberger]] and [[Martin Müller]] ('''2009'''). ''A lock-free multithreaded Monte-Carlo tree search algorithm'', [[Advances in Computer Games 12]], [http://webdocs.cs.ualberta.ca/%7Emmueller/ps/enzenberger-mueller-acg12.pdf pdf]
* [[Markus Enzenberger]] and [[Martin Müller]] ('''2009'''). ''[http://www.cs.ualberta.ca/research/theses-publications/technical-reports/2009/tr09-08 Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search]'', [http://www.cs.ualberta.ca/system/files/tech_report/2009/TR09-08.pdf pdf]
* [[Rémi Coulom]] ('''2009'''). ''The Monte-Carlo Revolution in Go''. JFFoS'2008: Japanese-French Frontiers of Science Symposium, [http://remi.coulom.free.fr/JFFoS/JFFoS.pdf slides as pdf]
* [[Mark Winands]] and [[Yngvi Björnsson]] ('''2009'''). ''Evaluation Function Based Monte-Carlo LOA''. [http://www.ru.is/faculty/yngvi/pdf/WinandsB09.pdf pdf] <ref>[http://www.open-chess.org/viewtopic.php?f=5&t=886 Monte Carlo in LOA] by [[Mark Watkins]], [[Computer Chess Forums|Open Chess Forum]], December 30, 2010</ref>
* [[Tristan Cazenave]] ('''2009'''). ''Nested Monte-Carlo Search''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2009.html#Cazenave09 IJCAI 2009], [http://www.lamsade.dauphine.fr/~cazenave/papers/nested.pdf pdf]
* [[Paolo Ciancarini]], [[Gian Piero Favini]] ('''2009'''). ''Monte Carlo Tree Search Techniques in the Game of Kriegspiel''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2009.html IJCAI 2009], [http://ijcai.org/papers09/Papers/IJCAI09-086.pdf pdf] » [[KriegSpiel]]
* [[Tristan Cazenave]] ('''2009'''). ''Monte-Carlo Kakuro''. [[Advances in Computer Games 12]], [http://www.lamsade.dauphine.fr/~cazenave/papers/kakuro.pdf pdf]
* [[István Szita]], [[Guillaume Chaslot]], [[Pieter Spronck]] ('''2009'''). ''Monte-Carlo Tree Search in Settlers of Catan''. [[Advances in Computer Games 12]], [http://ticc.uvt.nl/~pspronck/pubs/ACG12Szita.pdf pdf] <ref>[https://en.wikipedia.org/wiki/The_Settlers_of_Catan The Settlers of Catan from Wikipedia]</ref>
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2009'''). ''Parallel Nested Monte-Carlo Search''. NIDISC 2009, [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelNested.pdf pdf]
* [[Tomas Kozelek]] ('''2009'''). ''Methods of MCTS and the game Arimaa''. Master's thesis, [http://arimaa.com/arimaa/papers/TomasKozelekThesis/mt.pdf pdf] » [[Arimaa]]
* [[Kenta Sasaki]], [[Yoshiyuki Kotani]] ('''2009'''). ''Monte-Carlo Tree Search in the Game of Blokus-Duo''. [[Conferences#GPW|14th Game Programming Workshop]] <ref>[https://en.wikipedia.org/wiki/Blokus#Blokus_Duo.2FTravel_Blokus Blokus Duo from Wikipedia]</ref>
* [[David Silver]], [[Gerald Tesauro]] ('''2009'''). ''Monte-Carlo Simulation Balancing''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2009.html#SilverT09 ICML 2009], [http://www.machinelearning.org/archive/icml2009/papers/500.pdf pdf]
* [[Keh-Hsun Chen|Ken Chen]], [[Dawei Du]], [[Peigang Zhang]] ('''2009'''). ''Monte-Carlo Tree Search and Computer Go''. [http://www.informatik.uni-trier.de/~ley/db/series/sci/sci251.html#ChenDZ09 Advances in Information and Intelligent Systems 2009]
* [[David Silver]] ('''2009'''). ''Reinforcement Learning and Simulation-Based Search''. Ph.D. thesis, [[University of Alberta]], [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/thesis.pdf pdf]
* [[Seth Pellegrino]], [[Andrew Hubbard]], [[Jason Galbraith]], [[Peter D. Drake]], [[Yung-Pin Chen]] ('''2009'''). ''Localizing Search in Monte-Carlo Go using Statistical Covariance.'' [[ICGA Journal#32_3|ICGA Journal, Vol. 32, No. 3]]
==2010 ...==
* [[Julien Kloetzer]] ('''2010'''). ''[https://dspace.jaist.ac.jp/dspace/handle/10119/8867?locale=en Monte-Carlo Techniques: Applications to the Game of the Amazons]''. Ph.D. thesis, [[JAIST]]
* [[Yoshikuni Sato]], [[Daisuke Takahashi]] and [[Reijer Grimbergen]] ('''2010'''). ''A Shogi Program based on Monte-Carlo Tree Search''. [[ICGA Journal#33_2|ICGA Journal, Vol. 33, No. 2]]
* [[Richard J. Lorentz]] ('''2010'''). ''[http://www.springerlink.com/content/p4x16832317r1214/ Improving Monte-Carlo Tree Search in Havannah]''. [[CG 2010]]
* [[Amine Bourki]], [[Guillaume Chaslot]], [[Matthieu Coulm]], [[Vincent Danjean]], [[Hassen Doghmen]], [[Thomas Hérault]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Fabien Teytaud]], [[Olivier Teytaud]], [[Paul Vayssière]], [[Ziqin Yu]] ('''2010'''). ''[http://hal.inria.fr/inria-00512854/en/ Scalability and Parallelization of Monte-Carlo Tree Search]''. [[CG 2010]], [http://hal.inria.fr/docs/00/51/28/54/PDF/newcluster.pdf pdf]
* [[Julien Kloetzer]] ('''2010'''). ''Monte-Carlo Opening Books for Amazons''. [[CG 2010]]
* [[Arpad Rimmel]], [[Fabien Teytaud]], [[Olivier Teytaud]] ('''2010'''). ''[http://hal.inria.fr/inria-00485555/en/ Biasing Monte-Carlo Simulations through RAVE Values]''. [[CG 2010]], [http://hal.inria.fr/docs/00/48/55/55/PDF/poolrave.pdf pdf]
* [[Jean-Yves Audibert]] ('''2010'''). ''PAC-Bayesian aggregation and multi-armed bandits''. Habilitation thesis, [http://fr.wikipedia.org/wiki/Universit%C3%A9_Paris-Est Université Paris Est], [http://certis.enpc.fr/%7Eaudibert/Mes%20articles/hdr.pdf pdf], [http://certis.enpc.fr/%7Eaudibert/Mes%20articles/hdrSlides.pdf slides as pdf]
* [[Shih-Chieh Huang]], [[Rémi Coulom]], [[Shun-Shii Lin]] ('''2010'''). ''[http://remi.coulom.free.fr/CG2010-Simulation-Balancing/ Monte-Carlo Simulation Balancing in Practice]''. [[CG 2010]], [http://remi.coulom.free.fr/CG2010-Simulation-Balancing/SimulationBalancing.pdf pdf]
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Score Bounded Monte-Carlo Tree Search''. [[CG 2010]], [http://www.lamsade.dauphine.fr/~cazenave/papers/mcsolver.pdf pdf]
* [[Pim Nijssen]], [[Mark Winands]] ('''2010'''). ''Enhancements for Multi-Player Monte-Carlo Tree Search''. [[CG 2010]], [http://www.personeel.unimaas.nl/pim.nijssen/pub/cg10.pdf pdf]
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
* [[Shih-Chieh Huang]], [[Rémi Coulom]], [[Shun-Shii Lin]] ('''2010'''). ''Monte-Carlo Simulation Balancing applied to 9x9 Go''. [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Monte-Carlo Hex''. [http://www.lamsade.dauphine.fr/~cazenave/papers/hex.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2010'''). ''Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://www.lamsade.dauphine.fr/~cazenave/papers/ggp2009.pdf pdf 2009] » [[General Game Playing]]
* [[Broderick Arneson]], [[Ryan Hayward]], [[Philip Henderson]] ('''2010'''). ''Monte Carlo Tree Search in Hex''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://webdocs.cs.ualberta.ca/~hayward/papers/mcts-hex.pdf pdf]
* [[Hendrik Baier]], [[Peter D. Drake]] ('''2010'''). ''The power of forgetting: Improving the last-good-reply policy in Monte Carlo Go''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4
* [[Ingo Althöfer]] ('''2010'''). ''Game Self-Play with Pure Monte-Carlo: The Basin Structure''. [http://www.althofer.de/monte-carlo-basins-althoefer.pdf pdf]
* [[Fabien Teytaud]], [[Olivier Teytaud]] ('''2010'''). ''[http://hal.inria.fr/inria-00495078/en/ On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms]''. [http://hal.inria.fr/docs/00/49/50/78/PDF/cig2010.pdf pdf]
* [[Guillaume Chaslot]] ('''2010'''). ''Monte-Carlo Tree Search''. Ph.D. Thesis, [[Maastricht University]], [http://www.unimaas.nl/games/files/phd/Chaslot_thesis.pdf pdf]
* [[Jahn-Takeshi Saito]] ('''2010'''). ''Solving Difficult Game Positions''. Ph.D. Thesis, [[Maastricht University]], [http://www.unimaas.nl/games/files/phd/Saito_thesis.pdf pdf]
* [[Romaric Gaudel]], [[Michèle Sebag]] ('''2010'''). ''Feature Selection as a one-player game''. [http://www.icml2010.org/ ICML 2010], [http://www.icml2010.org/papers/247.pdf pdf]
* [[Hendrik Baier]] ('''2010'''). ''Adaptive Playout Policies for Monte-Carlo Go''. Master's thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/master/2010/Baier_Hendrik.pdf pdf]
* [[Thomas J. Walsh]], [[Sergiu Goschin]], [[Michael L. Littman]] ('''2010'''). ''Integrating sample-based planning and model-based reinforcement learning.'' [[AAAI]], [https://pdfs.semanticscholar.org/bdc9/bfb6ecc6fb5afb684df03d7220c46ebdbf4e.pdf pdf] » [[UCT]], [[Reinforcement Learning]]
'''2011'''
* [[Shih-Chieh Huang]], [[Rémi Coulom]], [[Shun-Shii Lin]] ('''2011'''). ''Time Management for Monte-Carlo Tree Search Applied to the Game of Go''. TAAI 2010, [http://remi.coulom.free.fr/Publications/TimeManagement.pdf pdf]
* [[Arpad Rimmel]], [[Fabien Teytaud]], [[Tristan Cazenave]] ('''2011'''). ''Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows''. Evostar 2011, [http://www.lamsade.dauphine.fr/~cazenave/papers/tsptw.pdf pdf]
* [[Cameron Browne]] ('''2011'''). ''The Dangers of Random Playouts''. [[ICGA Journal#34_1|ICGA Journal, Vol. 34, No. 1]]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2011'''). ''A Parallel General Game Player''. [http://www.kuenstliche-intelligenz.de/ KI Journal], Vol. 25, No. 1, [http://www.lamsade.dauphine.fr/~cazenave/papers/rootparallelggp.pdf pdf]
* [[Shih-Chieh Huang]] ('''2011'''). ''New Heuristics for Monte Carlo Tree Search Applied to the Game of Go''. Ph.D. thesis, [http://www.usgo.org/resources/downloads/Supercomputer%20Go%20Appendix%20Two.pdf pdf]
* [[Petr Baudiš]] ('''2011'''). ''Information Sharing in MCTS''. Master thesis, Faculty of Mathematics and Physics, [https://en.wikipedia.org/wiki/Charles_University_in_Prague Charles University in Prague], [http://pasky.or.cz/go/prace.pdf pdf]
* [[Petr Baudiš]] ('''2011'''). ''Balancing MCTS by Dynamically Adjusting the Komi Value''. [[ICGA Journal#34_3|ICGA Journal, Vol. 34, No. 3]]
* [[Richard J. Lorentz]] ('''2011'''). ''Experiments with Monte-Carlo Tree Search in the Game of Havannah''. [[ICGA Journal#34_3|ICGA Journal, Vol. 34, No. 3]]
* [[Kazuki Yoshizoe]], [[Akihiro Kishimoto]], [[Tomoyuki Kaneko]], [[Haruhiro Yoshimoto]], [[Yutaka Ishikawa]] ('''2011'''). ''Scalable Distributed Monte Carlo Tree Search''. [http://www.informatik.uni-trier.de/~ley/db/conf/socs/socs2011.html#YoshizoeKKYI11 SoCS2011], [http://www.is.titech.ac.jp/~kishi/pdf_file/socs2011pmcts.pdf pdf]
* [[Cheng-Wei Chou]], [[Olivier Teytaud]], [[Shi-Jim Yen]] ('''2011'''). ''Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo''. [http://www.informatik.uni-trier.de/~ley/db/conf/evoW/evoappl2011-1.html#ChouTY11 EvoApplications 2011] <ref>[http://www.grappa.univ-lille3.fr/icga/game.php?id=47 NoGo (ICGA Tournaments)]</ref>
* [[Shi-Jim Yen]], [[Jung-Kuei Yang]] ('''2011'''). ''Two-Stage Monte Carlo Tree Search for Connect6''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 3
* [[Nozomu Ikehata]], [[Takeshi Ito]] ('''2011'''). ''Monte-Carlo Tree Search In Ms. Pac-Man''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 3 <ref>[https://en.wikipedia.org/wiki/Ms._Pac-Man Ms. Pac-Man from Wikipedia]</ref>
* [[Junichi Hashimoto]], [[Akihiro Kishimoto]], [[Kazuki Yoshizoe]], [[Kokolo Ikeda]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_1 Accelerated UCT and Its Application to Two-Player Games]''. [[Advances in Computer Games 13]]
* [[Jan Stankiewicz]], [[Mark Winands]], [[Jos Uiterwijk]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_6 Monte-Carlo Tree Search Enhancements for Havannah]''. [[Advances in Computer Games 13]]
* [[Gabriel Van Eyck]], [[Martin Müller]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_2 Revisiting Move Groups in Monte-Carlo Tree Search]''. [[Advances in Computer Games 13]]
* [[Hendrik Baier]], [[Mark Winands]] ('''2011'''). ''Active Opening Book Application for Monte-Carlo Tree Search in 19x19 Go''. [http://allserv.kahosl.be/bnaic2011/ BNAIC 2011], [https://dke.maastrichtuniversity.nl/m.winands/documents/bnaic2011Baier.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_4 Time Management for Monte-Carlo Tree Search in Go]''. [[Advances in Computer Games 13]]
* [[Richard J. Lorentz]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_5 An MCTS Program to Play EinStein Würfelt Nicht!]'' [[Advances in Computer Games 13]]
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Hassen Doghmen]], [[Chang-Shing Lee]], [[Tsan-Cheng Su]], [[Fabien Teytaud]], [[Olivier Teytaud]], [[Hui-Ming Wang]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
* [[Bruno Bouzy]], [[Marc Métivier]], [[Damien Pellier]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_9 MCTS Experiments on the Voronoi Game]''. [[Advances in Computer Games 13]]
* [[Pim Nijssen]], [[Mark Winands]] ('''2011'''). ''Playout Search for Monte-Carlo Tree Search in Multi-Player Games''. [[Advances in Computer Games 13]]
* [[Jiao Wang]], [[Shiyuan Li]], [[Jitong Chen]], [[Xin Wei]], [[Huizhan Lv]], [[Xinhe Xu]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-31866-5_10?LI=true#page-1 4*4-Pattern and Bayesian Learning in Monte-Carlo Go]''. [[Advances in Computer Games 13]]
* [[Jeff Rollason]] ('''2011'''). ''[http://www.aifactory.co.uk/newsletter/2011_02_mcts_static.htm Mixing MCTS with Conventional Static Evaluation: Experiments and shortcuts en-route to full UCT]''. [[AI Factory]], Winter 2011 » [[UCT]], [[Evaluation]]
* [[Sylvain Gelly]], [[David Silver]] ('''2011'''). ''Monte-Carlo tree search and rapid action value estimation in computer Go''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 175, No. 11
* [[Lars Schaefers]], [[Marco Platzner]], [[Ulf Lorenz]] ('''2011'''). ''UCT-Treesplit - Parallel MCTS on Distributed Memory''. MCTS Workshop, Freiburg, Germany, [http://www.cs.uni-paderborn.de/fileadmin/Informatik/AG-Platzner/People/Schaefers/TreesplitICAPS.pdf pdf]
* [[Tobias Graf]], [[Ulf Lorenz]], [[Marco Platzner]], [[Lars Schaefers]] ('''2011'''). ''Parallel Monte-Carlo Tree Search for HPC Systems''. [http://www.informatik.uni-trier.de/~ley/db/conf/europar/europar2011-2.html Euro-Par 2011], [http://www.cs.uni-paderborn.de/fileadmin/Informatik/AG-Platzner/People/Schaefers/uctTreesplit.pdf pdf]
* [[Joel Veness]], [[Marc Lanctot]], [[Michael Bowling]] ('''2011'''). ''Variance Reduction in Monte-Carlo Tree Search''. [http://papers.nips.cc/book/advances-in-neural-information-processing-systems-24-2011 NIPS], [http://papers.nips.cc/paper/4288-variance-reduction-in-monte-carlo-tree-search.pdf pdf]
'''2012'''
* [[Michael L. Littman]] ('''2012'''). ''Technical Perspective: A New Way to Search Game Trees''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
* [[Oleg Arenz]] ('''2012'''). ''Monte Carlo Chess''. B.Sc. thesis, [[Darmstadt University of Technology]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2012/Arenz_Oleg.pdf pdf] » [[Stockfish]]
* [[Jeff Rollason]] ('''2012'''). ''[http://www.aifactory.co.uk/newsletter/2012_01_tuning_spades.htm Tuning Spades]''. [[AI Factory]], Summer 2012 » [[UCT]]
* [[Tristan Cazenave]], [[Fabien Teytaud]] ('''2012'''). ''Beam Nested Rollout Policy Adaptation''. [[ECAI CGW 2012]]
* [[André Fabbri]], [[Frédéric Armetta]], [[Eric Duchêne]], [[Salima Hassas]] ('''2012'''). ''A new self-acquired knowledge process for Monte Carlo Tree Search''. [[ECAI CGW 2012]]
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]] ('''2012'''). ''Sparse Sampling for Adversarial Games''. [[ECAI CGW 2012]]
* [[Niek Den Teuling]], [[Mark Winands]] ('''2012'''). ''Monte-Carlo Tree Search for the Simultaneous Move Game Tron''. [[ECAI CGW 2012]], [https://dke.maastrichtuniversity.nl/m.winands/documents/Tronpaper.pdf pdf]
* [[Jan Kuipers (Nikhef)|Jan Kuipers]], [[Aske Plaat]], [[Jos Vermaseren]], [[Jaap van den Herik]] ('''2012'''). ''Improving multivariate Horner schemes with Monte Carlo tree search''. [http://arxiv.org/abs/1207.7079 CoRR abs/1207.7079]
* [[Cameron Browne]], [[Edward Powley]], [[Daniel Whitehouse]], [[Simon Lucas]], [[Peter Cowling]], [[Philipp Rohlfshagen]], [[Stephen Tavener]], [[Diego Perez]], [[Spyridon Samothrakis]], [[Simon Colton]] ('''2012'''). ''[http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6145622&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F4804728%2F6169178%2F06145622.pdf%3Farnumber%3D6145622 A Survey of Monte Carlo Tree Search Methods]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 4, No. 1
* [[Pim Nijssen]], [[Mark Winands]] ('''2012'''). ''[http://ieeexplore.ieee.org/document/6266709/ Monte-Carlo Tree Search for the Hide-and-Seek Game Scotland Yard]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 4, No. 4 <ref>[https://en.wikipedia.org/wiki/Scotland_Yard_%28board_game%29 Scotland Yard (board game) from Wikipedia]</ref>
* [[Hendrik Baier]], [[Mark Winands]] ('''2012'''). ''Nested Monte-Carlo Tree Search for Online Planning in Large MDPs''. [http://www2.lirmm.fr/ecai2012/ ECAI 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/ecai2012.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2012'''). ''Beam Monte-Carlo Tree Search''. [http://dblp.uni-trier.de/db/conf/cig/cig2012.html#BaierW12 CIG 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/CIG2012_paper_32.pdf pdf]
* [[Adrien Couetoux]], [[Olivier Teytaud]], [[Hassen Doghmen]] ('''2012'''). ''Learning a Move-Generator for Upper Confidence Trees''. [http://ics2012.ndhu.edu.tw/ ICS 2012], [https://en.wikipedia.org/wiki/Hualien_City Hualien], [https://en.wikipedia.org/wiki/Taiwan Taiwan], December 2012
'''2013'''
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Chang-Shing Lee]], [[David L. Saint-Pierre]], [[Olivier Teytaud]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2013'''). ''Strategic Choices: Small Budgets and Simple Regret''. [[TAAI|TAAI 2012]], [http://www.csie.ndhu.edu.tw/csieweb/en/node/685 Excellent Paper Award], [https://hal.inria.fr/hal-00753145v2/document pdf]
* [[Daniel Shawul|Daniel S. Abdi]] ('''2013'''). ''Monte carlo methods for estimating game tree size''. [https://dl.dropboxusercontent.com/u/55295461/perft/perft.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=47740&topic_view=flat&start=11 Re: MC methods] by [[Daniel Shawul]], [[CCC]], April 13, 2013</ref> » [[Perft]]
* [[Marc Lanctot]] ('''2013'''). ''Monte Carlo Sampling and Regret Minimization for Equilibrium Computation and Decision-Making in Large Extensive Form Games''. Ph.D. thesis, [[University of Alberta]], advisor [[Michael Bowling]]
* [[Aviezri Fraenkel]] ('''2013'''). ''Reflection''. [[ICGA Journal#36_1|ICGA Journal, Vol. 36, No. 1]] » [[Stanislaw Ulam]]
* [[Jeff Rollason]] ('''2013'''). ''[http://www.aifactory.co.uk/newsletter/2013_01_reduce_burden.htm Reducing the burden of knowledge: Simulation-based methods in imperfect information games]''. [[AI Factory]], Summer 2013
* [[Abdallah Saffidine]] ('''2013'''). ''Solving Games and All That''. Ph.D. thesis, 2.5 Monte Carlo Tree Search
* [[Shih-Chieh Huang]], [[Martin Müller]] ('''2013'''). '' Investigating the Limits of Monte Carlo Tree Search Methods in Computer Go''. [[CG 2013]]
* [[Shih-Chieh Huang]], [[Broderick Arneson]], [[Ryan Hayward]], [[Martin Müller]], [[Jakub Pawlewicz]] ('''2013'''). ''MoHex 2.0: a pattern-based MCTS Hex player''. [[CG 2013]], [https://webdocs.cs.ualberta.ca/~hayward/papers/m2.pdf pdf]
* [[Tobias Graf]], [[Lars Schaefers]], [[Marco Platzner]] ('''2013'''). ''On Semeai Detection in Monte-Carlo Go''. [[CG 2013]], [http://www.cs.uni-paderborn.de/fileadmin/Informatik/AG-Platzner/publications/graf13_cg/graf13_cg.pdf pdf]
* [[Richard J. Lorentz]], [[Therese Horey]] ('''2013'''). ''Programming Breakthrough''. [[CG 2013]] » [[Breakthrough (Game)]]
* [[Ingo Althöfer]], [[Wesley Turner]] ('''2013'''). ''Anomalies of Pure Monte Carlo Search in Monte Carlo Perfect Games''. [[CG 2013]]
* [[Simon Viennot]], [[Kokolo Ikeda]] ('''2013'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-319-09165-5_3 Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search]''. [[CG 2013]]
* [[Sumudo Fernando]], [[Martin Müller]] ('''2013'''). ''Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go''. [[CG 2013]]
* [[Ingo Althöfer]] ('''2013'''). ''The wild Years are gone: Monte Carlo in Smoother Waters''. Conference Report [[CG 2013]], [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]]
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]], [[Mark Winands]] ('''2013'''). ''Monte Carlo *-Minimax Search''. [[Conferences#IJCAI|IJCAI 2013]]
* [[Pim Nijssen]] ('''2013'''). ''Monte-Carlo Tree Search for Multi-Player Games''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Nijssen_thesis.pdf pdf]
* [[Jeff Rollason]] ('''2013'''). ''[http://www.aifactory.co.uk/newsletter/2013_02_unknown_mcts.htm Searching the Unknown with MCTS]''. [[AI Factory]], Winter 2013
* [[David Silver]], [[Richard Sutton]], [[Martin Müller|Martin Mueller]] ('''2013'''). ''Temporal-Difference Search in Computer Go''. [http://icaps13.icaps-conference.org/technical-program/workshop-program/planning-and-learning/ ICAPS-13], [http://webdocs.cs.ualberta.ca/~sutton/papers/SSM-ICAPS-13.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2013'''). ''Monte-Carlo Tree Search and minimax hybrids''. [http://dblp.uni-trier.de/db/conf/cig/cig2013.html#BaierW13 CIG 2013], [https://dke.maastrichtuniversity.nl/m.winands/documents/paper%2049.pdf pdf]
* [[Timothy Furtak]], [[Michael Buro]] ('''2013'''). ''Recursive Monte Carlo search for imperfect information games''. [[IEEE#CIG|CIG 2013]], [https://skatgame.net/mburo/ps/recmc13.pdf pdf]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2013'''). ''Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification''. [http://arxiv.org/abs/1312.0841 CoRR abs/1312.0841]
* [[Arthur Guez]], [[David Silver]], [[Peter Dayan]] ('''2013'''). ''Scalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research Journal of Artificial Intelligence Research], Vol. 48, [https://www.jair.org/media/4117/live-4117-7507-jair.pdf pdf]
* [[Ari Weinstein]], [[Michael L. Littman]], [[Sergiu Goschin]] ('''2013'''). ''[http://proceedings.mlr.press/v24/weinstein12a.html Rollout-based Game-tree Search Outprunes Traditional Alpha-beta]''. [http://proceedings.mlr.press/ PMLR], Vol. 24 » [[UCT]]
'''2014'''
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''HEPGAME and the Simplification of Expressions''. [http://arxiv.org/abs/1405.6369 CoRR abs/1405.6369]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2014'''). ''Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi''. [http://arxiv.org/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Parallel Search]], [[x86-64]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''Why Local Search Excels in Expression Simplification''. [http://arxiv.org/abs/1409.5223 CoRR abs/1409.5223]
* [[Lars Schaefers]] ('''2014'''). ''Parallel Monte-Carlo Tree Search for HPC Systems and its Application to Computer Go''. Ph.D. thesis, [[University of Paderborn]], advisors [[Marco Platzner]], [[Ulf Lorenz]], [http://www.althofer.de/phd-thesis-schaefers.pdf pdf], [https://www.dropbox.com/s/x0lh7ky5lvj6c1y/PhdThesisSchaefers.pdf pdf]
* [[Rémi Munos]] ('''2014'''). ''From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning''. [http://dblp.uni-trier.de/db/journals/ftml/ftml7.html#Munos14 Foundations and Trends in Machine Learning, Vol. 7, No 1], [https://hal.archives-ouvertes.fr/hal-00747575 hal-00747575v5], [http://chercheurs.lille.inria.fr/~munos/papers/files/AAAI2013_slides.pdf slides as pdf]
* [[David W. King]] ('''2014'''). ''Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas''. Masters thesis, [https://en.wikipedia.org/wiki/Air_Force_Institute_of_Technology Air Force Institute of Technology], [http://www.afit.edu/docs/AFIT-ENG-14-M-44_King.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Crossings_%28game%29 Crossings from Wikipedia]</ref>
* [[David W. King]], [[Gilbert L. Peterson]] ('''2014'''). ''Epaminondas: Exploring Combat Tactics''. [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]] <ref> [https://en.wikipedia.org/wiki/Epaminondas_%28game%29 Epaminondas from Wikipedia]</ref>
* [[Ting-Fu Liao]], [[I-Chen Wu]], [[Guan-Wun Chen]], [[Chung-Chin Shih]], [[Po-Ya Kang]], [[Bing-Tsung Chiang]], [[Ting-Chu Ho]], [[Ti-Rong Wu]] ('''2014'''). ''A Study of Software Framework for Parallel Monte Carlo Tree Search''. [[Conferences#GPW19|GPW-2014]]
* [[Hendrik Baier]], [[Mark Winands]] ('''2014'''). ''Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions''. [[ECAI CGW 2014]]
* [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2014'''). ''Small and Large MCTS Playouts applied to Chinese Dark Chess Stochastic Game''. [[ECAI CGW 2014]]
* [[Tom Pepels]], [[Tristan Cazenave]], [[Mark Winands]], [[Marc Lanctot]] ('''2014'''). ''Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search''. [[ECAI CGW 2014]]
* [[Denis Robilliard]], [[Cyril Fonlupt]], [[Fabien Teytaud]] ('''2014'''). ''Monte-Carlo Tree Search for the Game of “7 Wonders”''. [[ECAI CGW 2014]] <ref>[https://en.wikipedia.org/wiki/7_Wonders_%28board_game%29 7 Wonders (board game) from WIkipedia]</ref>
* [[Johannes Heinrich]], [[David Silver]] ('''2014'''). ''[https://www.aaai.org/ocs/index.php/WS/AAAIW14/paper/view/8811 Self-Play Monte-Carlo Tree Search in Computer Poker]''. [[AAAI|AAAI-14 Workshop]]
==2015 ...==
* [[Richard J. Lorentz]] ('''2015'''). ''Early Playout Termination in MCTS''. [[Advances in Computer Games 14]]
* [[Tristan Cazenave]] ('''2015'''). ''Playout Policy Adaptation for Games''. [[Advances in Computer Games 14]]
* [[Tobias Graf]], [[Marco Platzner]] ('''2015'''). ''Adaptive Playouts in Monte Carlo Tree Search with Policy Gradient Reinforcement Learning''. [[Advances in Computer Games 14]]
* [[Chu-Hsuan Hsueh]], [[I-Chen Wu]], [[Wen-Jie Tseng]], [[Shi-Jim Yen]], [[Jr-Chang Chen]] ('''2015'''). ''Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program''. [[Advances in Computer Games 14]]
* [[Yusaku Mandai]], [[Tomoyuki Kaneko]] ('''2015'''). ''LinUCB Applied to Monte Carlo Tree Search''. [[Advances in Computer Games 14]]
* [[Yun-Ching Liu]], [[Yoshimasa Tsuruoka]] ('''2015'''). ''Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search''. [[Advances in Computer Games 14]]
* [[Jiao Wang]], [[Tan Zhu]], [[Hongye Li]], [[Chu-Hsuan Hsueh]], [[I-Chen Wu]] ('''2015'''). ''Belief-state Monte-Carlo tree search for Phantom games''. [http://dblp.uni-trier.de/db/conf/cig/cig2015.html#WangZLHW15 CIG 2015]
* [[Fabien Teytaud]], [[Julien Dehos]] ('''2015'''). ''On the Tactical and Strategic Behaviour of MCTS when Biasing Random Simulations''. [[ICGA Journal#38_2|ICGA Journal, Vol. 38, No. 2]]
* [[Jeff Rollason]] ('''2015'''). ''[http://www.aifactory.co.uk/newsletter/2015_02_mixing_immiscible.htm Mixing the Immiscible - MCTS and evaluation]''. [[AI Factory]], October 2015 <ref>[[Guillaume Chaslot]], [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]], [[Bruno Bouzy]] ('''2008'''). ''Progressive Strategies for Monte-Carlo Tree Search''. [http://www.worldscinet.com/nmnc/nmnc.shtml New Mathematics and Natural Computation], Vol. 4, No. 3, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.3015&rep=rep1&type=pdf pdf]</ref>
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Scaling Monte Carlo Tree Search on Intel Xeon Phi''. [http://arxiv.org/abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Parallel Search]], [[x86-64]]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Parallel Monte Carlo Tree Search from Multi-core to Many-core Processors''. [https://whova.com/portal/ieeet_201508/ TrustCom/BigDataSE/|ISPA 2015], [https://askeplaat.files.wordpress.com/2013/01/ispa2015.pdf pdf]
* [[Peter H. Jin]], [[Kurt Keutzer]] ('''2015'''). ''Convolutional Monte Carlo Rollouts in Go''. [http://arxiv.org/abs/1512.03375 arXiv:1512.03375]
* [[Naoki Mizukami]], [[Yoshimasa Tsuruoka]] ('''2015'''). ''Building a Computer Mahjong Player Based on Monte Carlo Simulation and Opponent Models''. [[IEEE#TOCIAIGAMES|IEEE CIG 2015]], [http://www.logos.ic.i.u-tokyo.ac.jp/~mizukami/paper/cig_2015.pdf pdf]
* [[Hendrik Baier]] ('''2015'''). ''Monte-Carlo Tree Search Enhancements for One-Player and Two-Player Domains''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Baier_thesis.pdf pdf] <ref>[[Dap Hartmann]] ('''2017'''). ''Let's Catch the Train to Monte-Carlo''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]]</ref>
* [[Lars Schaefers]], [[Marco Platzner]] ('''2015'''). ''[http://ieeexplore.ieee.org/document/6876158/ Distributed Monte Carlo Tree Search: A Novel Technique and its Application to Computer Go]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 7, No. 4 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125&start=18 Re: Minmax backup operator for MCTS] by [[Brahim Hamadicharef]], [[CCC]], December 30, 2017</ref>
* [[Bojun Huang]] ('''2015'''). ''[https://www.semanticscholar.org/paper/Pruning-Game-Tree-by-Rollouts-Huang/a38b358745067f71a9c780db117ae2471e693d63 Pruning Game Tree by Rollouts]''. [[AAAI]] » [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66280&start=67 Re: Announcing lczero] by [[Daniel Shawul]], [[CCC]], January 21, 2018 » [[LCZero]]</ref>
'''2016'''
* [[David Silver]], [[Shih-Chieh Huang|Aja Huang]], [[Chris J. Maddison]], [[Arthur Guez]], [[Laurent Sifre]], [[George van den Driessche]], [[Julian Schrittwieser]], [[Ioannis Antonoglou]], [[Veda Panneershelvam]], [[Marc Lanctot]], [[Sander Dieleman]], [[Dominik Grewe]], [[John Nham]], [[Nal Kalchbrenner]], [[Ilya Sutskever]], [[Timothy Lillicrap]], [[Madeleine Leach]], [[Koray Kavukcuoglu]], [[Thore Graepel]], [[Demis Hassabis]] ('''2016'''). ''[http://www.nature.com/nature/journal/v529/n7587/full/nature16961.html Mastering the game of Go with deep neural networks and tree search]''. [https://en.wikipedia.org/wiki/Nature_%28journal%29 Nature], Vol. 529 » [[AlphaGo]]
* [[Tobias Graf]], [[Marco Platzner]] ('''2016'''). ''Using Deep Convolutional Neural Networks in Monte Carlo Tree Search''. [[CG 2016]]
* [[Takahisa Imagawa]], [[Tomoyuki Kaneko]] ('''2016'''). ''Monte Carlo Tree Search with Robust Exploration''. [[CG 2016]]
* [[Joris Duguépéroux]], [[Ahmad Mazyad]], [[Fabien Teytaud]], [[Julien Dehos]] ('''2016'''). ''Pruning playouts in Monte-Carlo Tree Search for the game of Havannah''. [[CG 2016]]
* [[Peter H. Jin]], [[Kurt Keutzer]] ('''2016'''). ''Convolutional Monte Carlo Rollouts for Computer Go''. [[CG 2016]]
* [[Hendrik Baier]], [[Mark Winands]] ('''2016'''). ''Time Management for Monte Carlo Tree Search''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 8, No. 3, [https://dke.maastrichtuniversity.nl/m.winands/documents/time_management_for_monte_carlo_tree_search.pdf draft as pdf]
* [[Katsuki Ohto]], [[Tetsuro Tanaka]] ('''2016'''). ''Application of Monte Carlo Tree Search to Curling AI''. [[Conferences#GPW21|21st Game Programming Workshop]]
'''2017'''
* [[Dap Hartmann]] ('''2017'''). ''Let's Catch the Train to Monte-Carlo''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]], Review on [[Hendrik Baier#PhD|Hendrik Baier's Ph.D. thesis]]
* [[Katsuki Ohto]], [[Tetsuro Tanaka]] ('''2017'''). ''A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action among Similar States''. [[Advances in Computer Games 15]]
* [[Naoki Mizukami]], [[Jun Suzuki]], [[Hirotaka Kameko]], [[Yoshimasa Tsuruoka]] ('''2017'''). ''Exploration Bonuses Based on Upper Confidence Bounds for Sparse Reward Games''. [[Advances in Computer Games 15]]
* [[David Silver]], [[Thomas Hubert]], [[Julian Schrittwieser]], [[Ioannis Antonoglou]], [[Matthew Lai]], [[Arthur Guez]], [[Marc Lanctot]], [[Laurent Sifre]], [[Dharshan Kumaran]], [[Thore Graepel]], [[Timothy Lillicrap]], [[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://arxiv.org/abs/1712.01815 arXiv:1712.01815] » [[AlphaZero]]
* [[Shantanu Thakoor]], [[Surag Nair]], [[Megha Jhunjhunwala]] ('''2017'''). ''Learning to Play Othello Without Human Knowledge''. [[Stanford University]], [https://github.com/suragnair/alpha-zero-general/blob/master/pretrained_models/writeup.pdf pdf] » [[AlphaZero]], [[Othello]], [[Deep Learning]] <ref>[https://github.com/suragnair/alpha-zero-general GitHub - suragnair/alpha-zero-general: A clean and simple implementation of a self-play learning algorithm based on AlphaGo Zero (any game, any framework!)]</ref>
* [[Hendrik Baier]] ('''2017'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-57969-6_5 A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta]''. [https://link.springer.com/book/10.1007%2F978-3-319-57969-6 Computer Games] » [[Bojun Huang#Rollout|Rollout Paradigm]]
* [[Tristan Cazenave]] ('''2017'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-57969-6_4 Nested Rollout Policy Adaptation with Selective Policies]''. [https://link.springer.com/book/10.1007%2F978-3-319-57969-6 Computer Games]
=Forum Posts=
==2010 ...==
* [https://groups.google.com/d/msg/computer-go-archive/JrrSovvgTV0/UbPOufyTApQJ [Computer-go] learning patterns for mc go] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], April 26, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=38554 UCT surprise for checkers !] by [[Daniel Shawul]], [[CCC]], March 25, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41730 MCTS without random playout?] by [[Antonio Torrecillas]], [[CCC]], January 01, 2012 » [[B*]]
* [http://www.talkchess.com/forum/viewtopic.php?t=47740&topic_view=flat&start=11 Re: MC methods] by [[Daniel Shawul]], [[CCC]], April 13, 2013 » [[Perft]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=59118 monte carlo tree search question] by [[Marco Belli]], [[CCC]], January 31, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=61801 The scaling of Deep Learning MCTS Go engines] by [[Kai Laskos]], [[CCC]], October 23, 2016 » [[Deep Learning]], [[Go]], [[Monte-Carlo Tree Search|MCTS]]
'''2017'''
* [https://groups.google.com/forum/#!topic/fishcooking/AE4EgWQ20dY A branch to test the Monte Carlo algorithm in Stockfish] by Stephane Nicolet, [[Computer Chess Forums|FishCooking]], December 06, 2017 » [[Stockfish]], [[AlphaZero]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65964 Nebiyu-MCTS vs TSCP 1-0] by [[Daniel Shawul]], [[CCC]], December 10, 2017 » [[Nebiyu]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66013 An AlphaZero inspired project] by [[Truls Edvard Stokke]], [[CCC]], December 14, 2017 » [[AlphaZero]]
* [https://groups.google.com/d/msg/fishcooking/rMCfc8zMerc/F01WuNtDCgAJ MCTS wrapper for StockFish] by [[Jonathan Baxter]], [[Computer Chess Forums|FishCooking]], December 19, 2017 » [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017 » [[Raghuram Ramanujan#UCT|Sampling-Based Planning]]
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=32429 MCTS weakness wrt AB (via Daniel Shawul)] by [[Chris Whittington]], [[Computer Chess Forums|Rybka Forum]], December 25, 2017
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66414 Alpha-Beta as a rollouts algorithm] by [[Daniel Shawul]], [[CCC]], January 25, 2018 » [[Alpha-Beta]], [[MCαβ]], [[Scorpio]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66886 comparing minimax and averaging MCTS with alphabeta rollouts] by [[Daniel Shawul]], [[CCC]], March 20, 2018 » [[Scorpio]]
* [http://www.talkchess.com/forum/viewtopic.php?t=67235 MCTS beginner questions] by [[Martin Fierz]], [[CCC]], April 25, 2018
=External Links=
==Monte Carlo Tree Search==
* [https://en.wikipedia.org/wiki/Monte_Carlo_tree_search Monte Carlo tree search from Wikipedia]
* [http://senseis.xmp.net/?MonteCarlo Sensei's Library: Monte Carlo Tree Search]
* [http://senseis.xmp.net/?UCT Sensei's Library: UCT]
* [http://mcts.ai/index.html Monte Carlo Tree Search - Home] by [[Cameron Browne]]
* [http://www.althofer.de/lange-nacht-jena.html Lange Nacht der Wissenschaften - Long Night of Sciences Jena - 2007] by [[Ingo Althöfer]], [[Jakob Erdmann#UCT|MC and UCT poster]] by [[Jakob Erdmann]]
* [http://web.stanford.edu/~surag/posts/alphazero.html A Simple Alpha(Go) Zero Tutorial] by [[Surag Nair]], [[Stanford University]], December 29, 2017 » [[AlphaZero]], [[Deep Learning]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66179 A Simple Alpha(Go) Zero Tutorial] by Oliver Roese, [[CCC]], December 30, 2017</ref>
: [https://github.com/suragnair/alpha-zero-general GitHub - suragnair/alpha-zero-general: A clean and simple implementation of a self-play learning algorithm based on AlphaGo Zero (any game, any framework!)]
==Monte Carlo Misc==
* [http://www.chessbase.com/newsdetail.asp?newsid=5075 Rybka's Monte Carlo analysis] by [[Steve Lopez]], [[ChessBase|ChessBase News]], February 03, 2009 » [[Rybka]]
* [https://en.wikipedia.org/wiki/Monte_Carlo_%28disambiguation%29 Monte Carlo (disambiguation) from Wikipedia]
: [https://en.wikipedia.org/wiki/Monte_Carlo_algorithm Monte Carlo algorithm]
: [https://en.wikipedia.org/wiki/Monte_Carlo_method Monte Carlo method]
: [https://en.wikipedia.org/wiki/Monte_Carlo Monte Carlo]
: [https://en.wikipedia.org/wiki/Monte_Carlo_Casino Monte Carlo Casino]
* [http://www.crapsdicecontrol.com/monte_carlo.htm A History of Monte Carlo]
* [http://www.dartmouth.edu/%7Erc/classes/soft_dev/C_simple_ex.html Software Development in the UNIX Environment - Example C Program to Compute PI Using A Monte Carlo Method]
* [http://www.eveandersson.com/pi/monte-carlo-circle Calculation of Pi Using the Monte Carlo Method] by [http://www.eveandersson.com/ Eve Astrid Andersson]
* [https://en.wikipedia.org/wiki/Slot_machine Slot machine from Wikipedia]
* [http://videolectures.net/icml09_silver_mcsb/ Monte-Carlo Simulation Balancing - videolectures.net] by [[David Silver]] <ref>[[David Silver]], [[Gerald Tesauro]] ('''2009'''). ''Monte-Carlo Simulation Balancing''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2009.html#SilverT09 ICML 2009], [http://www.machinelearning.org/archive/icml2009/papers/500.pdf pdf]</ref>
* [[Videos#MarcusMiller|Marcus Miller]] - [https://en.wikipedia.org/wiki/State_of_Mind_(Raul_Mid%C3%B3n_album) State of Mind] ([https://en.wikipedia.org/wiki/Ra%C3%BAl_Mid%C3%B3n Raúl Midón]), [https://fr.wikipedia.org/wiki/A_Night_in_Monte-Carlo A Night In Monte-Carlo] (2010), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: feat. [https://en.wikipedia.org/wiki/Ra%C3%BAl_Mid%C3%B3n Raúl Midón], [[Videos#RoyHargrove|Roy Hargrove]] and the [https://en.wikipedia.org/wiki/Monte-Carlo_Philharmonic_Orchestra Monte-Carlo Philharmonic Orchestra], November 29, 2008, [http://maboum.com/news-monte-carlo-jazz-festival-2008 Monte-Carlo Jazz Festival]
: {{#evu:https://www.youtube.com/watch?v=Gbc72rfyq94|alignment=left|valignment=top}}
=References=
<references />
'''[[Search|Up one level]]'''
[[FILE:Edvard Munch - At the Roulette Table in Monte Carlo - Google Art Project.jpg|border|right|thumb|[[Arts#Munch|Edvard Munch]] - At the Roulette Table in Monte Carlo <ref>[[Arts#Munch|Edvard Munch]], [https://en.wikipedia.org/wiki/File:Edvard_Munch_-_At_the_Roulette_Table_in_Monte_Carlo_-_Google_Art_Project.jpg At the Roulette Table in Monte Carlo, 1893], [https://en.wikipedia.org/wiki/Edvard_Munch Edvard Munch from Wikipedia]</ref> ]]
'''Monte Carlo Tree Search''', (Monte-Carlo Tree Search, MCTS)<br/>
is a [[Best-First|Best-First search]] algorithm based on [https://en.wikipedia.org/wiki/Randomness random] playouts. In conjunction with [[UCT]] ('''U'''pper '''C'''onfidence bounds applied to '''T'''rees) Monte-Carlo Tree Search has yielded in a breakthrough in [[Go|Computer Go]] <ref>[[Rémi Coulom]] ('''2009'''). ''The Monte-Carlo Revolution in Go''. JFFoS'2008: Japanese-French Frontiers of Science Symposium, [http://remi.coulom.free.fr/JFFoS/JFFoS.pdf slides as pdf]</ref>, and is also successful in [[Amazons]] <ref>[[Julien Kloetzer]], [[Hiroyuki Iida]], [[Bruno Bouzy]] ('''2007'''). ''The Monte-Carlo approach in Amazons''. [[CGW 2007]]</ref> <ref>[[Richard J. Lorentz]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_2 Amazons Discover Monte-Carlo]''. [[CG 2008]]</ref>, [[Lines of Action]] <ref>[[Mark Winands]] and [[Yngvi Björnsson]] ('''2009'''). ''Evaluation Function Based Monte-Carlo LOA''. [http://www.ru.is/faculty/yngvi/pdf/WinandsB09.pdf pdf]</ref>, [[Havannah]] <ref>[[Richard J. Lorentz]] ('''2010'''). ''[http://www.springerlink.com/content/p4x16832317r1214/ Improving Monte-Carlo Tree Search in Havannah]''. [[CG 2010]]</ref>, [[Hex]] <ref>[[Broderick Arneson]], [[Ryan Hayward]], [[Philip Henderson]] ('''2010'''). ''Monte Carlo Tree Search in Hex''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://webdocs.cs.ualberta.ca/~hayward/papers/mcts-hex.pdf pdf]</ref>, [[Checkers]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=38554 UCT surprise for checkers !] by [[Daniel Shawul]], [[CCC]], March 25, 2011</ref> and other [[Games]] with some difficulties in position evaluation, but until December 2017, when a [[Google]] [[DeepMind]] team reported on [[AlphaZero]] <ref>[[David Silver]], [[Thomas Hubert]], [[Julian Schrittwieser]], [[Ioannis Antonoglou]], [[Matthew Lai]], [[Arthur Guez]], [[Marc Lanctot]], [[Laurent Sifre]], [[Dharshan Kumaran]], [[Thore Graepel]], [[Timothy Lillicrap]], [[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://arxiv.org/abs/1712.01815 arXiv:1712.01815]</ref>, not for [[Chess]] <ref>[[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010]</ref> <ref>[[Oleg Arenz]] ('''2012'''). ''[http://www.ke.tu-darmstadt.de/bibtex/publications/show/2321 Monte Carlo Chess]''. B.Sc. thesis, [[Darmstadt University of Technology]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2012/Arenz_Oleg.pdf pdf]</ref>.
MCTS is based on randomized explorations of the [[Search Space|search space]]. Using the results of previous explorations, the algorithm gradually grows a [[Search Tree|game tree]] in [[Memory|memory]], and successively becomes better at accurately estimating the values of the most promising moves <ref>[[Guillaume Chaslot]], [[Mark Winands]], [[Jaap van den Herik]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_6 Parallel Monte-Carlo Tree Search]''. [[CG 2008]], [https://dke.maastrichtuniversity.nl/m.winands/documents/multithreadedMCTS2.pdf pdf]</ref>.
=Four Phases=
MCTS consists of four strategic phases, repeated as long as there is time left <ref>[[Guillaume Chaslot]], [[Mark Winands]], [[Jaap van den Herik]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_6 Parallel Monte-Carlo Tree Search]''. [[CG 2008]], [https://dke.maastrichtuniversity.nl/m.winands/documents/multithreadedMCTS2.pdf pdf]</ref> :
# In the '''Selection''' phase the tree is traversed from the [[Root|root node]] until it selects a [[Leaf Node|leaf node]] that is not added to the tree yet
# The '''Expansion''' strategy adds the leaf node to the tree
# The '''Simulation''' strategy plays moves in self-play until the end of the game. The result is either 1, 0 ,-1
# The '''Backpropagation''' strategy propagates the results through the tree
[[FILE:MCTS (English).svg|none|border|text-bottom]]
Steps of Monte Carlo Tree Search <ref>[https://commons.wikimedia.org/wiki/File:MCTS_%28English%29.svg Steps of Monte-Carlo Tree Search] by Mciura, March 31, 2013, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [https://en.wikipedia.org/wiki/Monte_Carlo_tree_search Monte Carlo tree search from Wikipedia]</ref>
<span id="PureMCS"></span>
=Pure Monte-Carlo search=
'''Pure Monte-Carlo search''' with parameter T means that for each feasible move T random games are generated. The move with the best average score is played. A game is called “Monte Carlo perfect” when this procedure converges to perfect play for each position, when T goes to infinity. However, with limited time per move, increasing T does not guarantee to find a better move <ref>[[Ingo Althöfer]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-31866-5_22 On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness]''. [[Advances in Computer Games 13]]</ref>.
=UCT=
[[UCT]] ('''U'''pper '''C'''onfidence bounds applied to '''T'''rees) deals with the flaw of Monte-Carlo Tree Search, when a program may favor a losing move with only one or a few forced refutations, but due to the vast majority of other moves provides a better random playout score than other, better moves <ref>[[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]</ref>.
=See also=
* [[Deep Learning]]
* [[MCαβ]]
* [[Jakob Erdmann#UCT|MC and UCT poster]] by [[Jakob Erdmann]]
* [[Bojun Huang#Rollout|Rollout Paradigm]]
* [[Raghuram Ramanujan#UCT|Sampling-Based Planning]]
* [[Simulated Annealing]]
* [[UCT]]
=Publications=
==1987==
* [[Bruce Abramson]], [[Richard Korf]] ('''1987'''). ''A Model of Two-Player Evaluation Functions.'' [http://www.aaai.org/Conferences/AAAI/aaai87.php AAAI-87]. [http://www.aaai.org/Papers/AAAI/1987/AAAI87-016.pdf pdf]
==1990 ...==
* [[Bruce Abramson]] ('''1990'''). ''[http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=44404 Expected-Outcome: A General Model of Static Evaluation]''. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(2): 182-193.
* [[Bruce Abramson]] ('''1990'''). ''An Analysis of Expected-Outcome.'' Journal of Experimental and Theoretical Artificial Intelligence 2: 55-73.
* [[Bruce Abramson]] ('''1991'''). ''The Expected-Outcome Model of Two-Player Games.'' Part of the series, Research Notes in Artificial Intelligence (San Mateo: Morgan Kaufmann, 1991).
* [[Bernd Brügmann]] ('''1993'''). ''Monte Carlo Go''. [http://www.ideanest.com/vegos/MonteCarloGo.pdf pdf]
==2000 ...==
* [[Bruno Bouzy]], [[Bernard Helmstetter]] ('''2003'''). ''Monte Carlo Go Developments''. [[Advances in Computer Games 10]], [http://www.ai.univ-paris8.fr/~bh/articles/acg10-mcgo.pdf pdf]
* [[Bruno Bouzy]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_5 Associating Shallow and Selective Global Tree Search with Monte Carlo for 9 × 9 Go]''. [[CG 2004]]
* [[Tristan Cazenave]] ('''2004'''). ''Monte Carlo Real Time Strategy''. [http://www.lamsade.dauphine.fr/~cazenave/papers/poster-mcrts.pdf pdf]
==2005 ...==
* [[Tristan Cazenave]], [[Bernard Helmstetter]] ('''2005'''). ''Combining tactical search and Monte-Carlo in the game of Go''. IEEE [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2005.html#CazenaveH05 CIG 2005], [http://www.ai.univ-paris8.fr/~bh/articles/searchmcgo.pdf pdf], [http://www.lamsade.dauphine.fr/~cazenave/papers/searchmcgo.pdf pdf]
* [[Bruno Bouzy]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_8 Move-Pruning Techniques for Monte-Carlo Go]''. [[Advances in Computer Games 11]]
* [[Bruno Bouzy]] ('''2005'''). ''Associating domain-dependent knowledge and Monte Carlo approaches within a go program''. Information Sciences, Heuristic Search and Computer Game Playing IV
'''2006'''
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]
* [[Sylvain Gelly]], [[Yizao Wang]] ('''2006'''). ''Exploration exploitation in Go: UCT for Monte-Carlo Go''. [http://www.lri.fr/%7Egelly/paper/nips_exploration_exploitation_mogo.pdf pdf]
* [[Sylvain Gelly]], [[Yizao Wang]], [[Rémi Munos]], [[Olivier Teytaud]] ('''2006'''). ''Modification of UCT with Patterns in Monte-Carlo Go''. [http://hal.inria.fr/inria-00117266 INRIA]
* [[Levente Kocsis]], [[Csaba Szepesvári]], [[Jan Willemson]] ('''2006'''). ''Improved Monte-Carlo Search''. [http://www.sztaki.hu/~szcsaba/papers/cg06-ext.pdf pdf]
* [[Jahn-Takeshi Saito]], [[Guillaume Chaslot]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_5 Monte-Carlo Proof-Number Search for Computer Go]''. [[CG 2006]]
* [[Rémi Coulom]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_7 Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search]''. [[CG 2006]]
* [[Bruno Bouzy]] ('''2006'''). ''History and Territory Heuristics for Monte-Carlo Go''. New Mathematics and Natural Computation
* [[Haruhiro Yoshimoto]], [[Kazuki Yoshizoe]], [[Tomoyuki Kaneko]], [[Akihiro Kishimoto]], [[Kenjiro Taura]] ('''2006'''). ''[http://dl.acm.org/citation.cfm?id=1597359 Monte Carlo Go Has a Way to Go]''. [http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai2006.html#YoshimotoYKKT06 AAAI 2006], [http://www.aaai.org/Papers/AAAI/2006/AAAI06-168.pdf pdf]
'''2007'''
* [[Rémi Coulom]] ('''2007'''). ''[http://remi.coulom.free.fr/Hakone2007/ Monte-Carlo Tree Search in Crazy Stone]''. [http://remi.coulom.free.fr/Hakone2007/Hakone.pdf slides as pdf]
* [[Yizao Wang]], [[Sylvain Gelly]] ('''2007'''). ''Modifications of UCT and Sequence-Like Simulations for Monte-Carlo Go''. IEEE Symposium on Computational Intelligence and Games, Honolulu, USA, 2007, [http://www.stat.lsa.umich.edu/%7Eyizwang/publications/wang07modifications.pdf pdf]
* [[Shugo Nakamura]], [[Makoto Miwa]], [[Takashi Chikayama]] ('''2007'''). ''Improvement of UCT using evaluation function''. [http://www.computer-shogi.org/gpw/gpw12_e.html 12th Game Programming Workshop 2007]
* [[Keh-Hsun Chen|Ken Chen]], [[Peigang Zhang]] ('''2007'''). ''Monte-Carlo Go with Knowledge-Guided Simulations''. [[CGW 2007]]
* [[Tristan Cazenave]] ('''2007'''). ''Reflexive Monte-Carlo Search''. [[CGW 2007]], [http://www.lamsade.dauphine.fr/~cazenave/papers/reflexmc.pdf pdf]
* [[François van Lishout]], [[Guillaume Chaslot]], [[Jos Uiterwijk]] ('''2007'''). ''[https://www.researchgate.net/publication/228378473_Monte-Carlo_tree_search_in_backgammon Monte-Carlo Tree Search in Backgammon]''. [[CGW 2007]]
* [[Julien Kloetzer]], [[Hiroyuki Iida]], [[Bruno Bouzy]] ('''2007'''). ''The Monte-Carlo approach in Amazons''. [[CGW 2007]]
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2007'''). ''On the Parallelization of UCT''. [[CGW 2007]], [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelUCT.pdf pdf]
* [[Jahn-Takeshi Saito]], [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2007'''). ''Grouping Nodes for Monte-Carlo Tree Search''. [[CGW 2007]]
* [[Tristan Cazenave]] ('''2007'''). ''Evolving Monte-Carlo Tree Search Algorithms''. [http://www.lamsade.dauphine.fr/~cazenave/papers/evolveMC.pdf pdf]
* [[Pim Nijssen]] ('''2007'''). ''Playing Othello Using Monte Carlo''. Bachelor's Thesis, [[Maastricht University]], [http://www.personeel.unimaas.nl/pim.nijssen/pub/bsc.pdf pdf]
'''2008'''
* [[Keh-Hsun Chen|Ken Chen]], [[Peigang Zhang]] ('''2008'''). ''Monte-Carlo Go with Knowledge-Guided Simulations''. [[ICGA Journal#31_2|ICGA Journal, Vol. 31, No. 2]]
* [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]], [http://fr.linkedin.com/pub/yann-kalemkarian/7/7aa/716 Yann Kalemkarian] ('''2008'''). ''The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning''. ICINCO-ICSO 2008: 244-249, [http://hal.archives-ouvertes.fr/docs/00/28/78/67/PDF/icin08.pdf pdf], [http://www.lri.fr/%7Eteytaud/UCTpara.pdf slides as pdf]
* [[Guillaume Chaslot]], [[Louis Chatriot]], [[Christophe Fiter]], [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Julien Pérez]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2008'''). ''Combining expert, offline, transient and online knowledge in Monte-Carlo exploration''. [http://www.lri.fr/%7Eteytaud/eg.pdf pdf]
* [[Guillaume Chaslot]], [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]], [[Bruno Bouzy]] ('''2008'''). ''Progressive Strategies for Monte-Carlo Tree Search''. [http://www.worldscinet.com/nmnc/nmnc.shtml New Mathematics and Natural Computation], Vol. 4, No. 3, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.3015&rep=rep1&type=pdf pdf] <ref>[[Jeff Rollason]] ('''2015'''). ''[http://www.aifactory.co.uk/newsletter/2015_02_mixing_immiscible.htm Mixing the Immiscible - MCTS and evaluation]''. [[AI Factory]], October 2015</ref>
* [[Guillaume Chaslot]], [[Sander Bakkes]], [[István Szita]] and [[Pieter Spronck]] ('''2008'''). ''Monte-Carlo Tree Search: A New Framework for Game AI''. [http://sander.landofsand.com/publications/AIIDE08_Chaslot.pdf pdf]
* [[Guillaume Chaslot]], [[Mark Winands]], [[István Szita]], and [[Jaap van den Herik]]. ('''2008'''). ''Cross-entropy for Monte-Carlo Tree Search''. [[ICGA Journal#31_3|ICGA Journal, Vol. 31, No. 3]], [http://www.personeel.unimaas.nl/m-winands/documents/crossmc.pdf pdf]
* [[Maarten Schadd]], [[Mark Winands]], [[Jaap van den Herik]], [[Huib Aldewereld]] ('''2008'''). ''Addressing NP-Complete Puzzles with Monte-Carlo Methods''. In Volume 9: Proceedings of the AISB 2008 Symposium on Logic and the Simulation of Interaction and Reasoning, pages 55-61, Brighton, UK, 2008. The Society for the study of Artificial Intelligence and Simulation of Behaviour. [http://www.personeel.unimaas.nl/Maarten-Schadd/Papers/2008SameGameAISB.pdf pdf]
* [[Maarten Schadd]], [[Mark Winands]], [[Jaap van den Herik]], [[Guillaume Chaslot]], [[Jos Uiterwijk]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_1 Single-Player Monte-Carlo Tree Search]''. [[CG 2008]], [http://www.personeel.unimaas.nl/Maarten-Schadd/Papers/2008SameGameCG.pdf pdf]
* [[Richard J. Lorentz]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_2 Amazons Discover Monte-Carlo]''. [[CG 2008]]
* [[Mark Winands]], [[Yngvi Björnsson]], [[Jahn-Takeshi Saito]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_3 Monte-Carlo Tree Search Solver]''. [[CG 2008]], [http://www.ru.is/faculty/yngvi/pdf/WinandsBS08.pdf pdf]
* [[Nathan Sturtevant]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_4 An Analysis of UCT in Multi-player Games]''. [[CG 2008]]
* [[Guillaume Chaslot]], [[Mark Winands]], [[Jaap van den Herik]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_6 Parallel Monte-Carlo Tree Search]''. [[CG 2008]], [https://dke.maastrichtuniversity.nl/m.winands/documents/multithreadedMCTS2.pdf pdf]
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_7 A Parallel Monte-Carlo Tree Search Algorithm]''. [[CG 2008]], [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelMCTS.pdf pdf]
* [[Keh-Hsun Chen|Ken Chen]], [[Dawei Du]], [[Peigang Zhang]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_9 A Fast Indexing Method for Monte-Carlo Go]''. [[CG 2008]]
* [[Yizao Wang]], [[Jean-Yves Audibert]], [[Rémi Munos]] ('''2008'''). ''Algorithms for Infinitely Many-Armed Bandits''. Advances in Neural Information Processing Systems, [http://www.stat.lsa.umich.edu/%7Eyizwang/publications/wang08algorithms.pdf pdf], Supplemental material - [http://www.stat.lsa.umich.edu/%7Eyizwang/publications/wang08algorithmsSupp.pdf pdf]
* [http://en.scientificcommons.org/james_h_brodeur James H. Brodeur], [http://en.scientificcommons.org/benjamin_e_childs Benjamin E. Childs] and [[Levente Kocsis]] ('''2008'''). ''Transpositions and Move Groups in Monte Carlo Tree Search.'' [http://eprints.pascal-network.org/archive/00004571/01/8057.pdf pdf]
* [[Hilmar Finnsson]] and [[Yngvi Björnsson]]. ('''2008'''). ''Simulation-Based Approach to General Game Playing.'' In The Twenty-Third AAAI Conference on Artificial Intelligence, [[AAAI]] Press, 2008. Accepted. [http://www.ru.is/faculty/yngvi/pdf/FinnssonB08a.pdf pdf], [http://www.aaai.org/Papers/AAAI/2008/AAAI08-041.pdf pdf] » [[General Game Playing]]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2008'''). ''Monte-Carlo Tree Search for General Game Playing''. [http://www.lamsade.dauphine.fr/~cazenave/papers/ggp2008.pdf pdf] » [[General Game Playing]]
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2008'''). ''A Parallel Monte-Carlo Tree Search Algorithm''. [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelMCTS.pdf pdf]
* [[Ingo Althöfer]] ('''2008'''). ''On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations''. Technical Report, [http://www.althofer.de/mc-laziness.pdf pdf]
* [[Kazutomo Shibahara]], [[Yoshiyuki Kotani]] ('''2008'''). ''Combining Final Score with Winning Percentage using Sigmoid Function in Monte-Carlo Algorithm''. [[Conferences#GPW|13th Game Programming Workshop]], [http://www.csse.uwa.edu.au/cig08/Proceedings/papers/8016.pdf pdf]
* [[Shogo Takeuchi]], [[Tomoyuki Kaneko]], [[Kazunori Yamaguchi]] ('''2008'''). ''Evaluation of Monte Carlo tree search and the application to Go''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2008.html CIG 2008]
'''2009'''
* [[Jean-Yves Audibert]], [[Rémi Munos]], [[Csaba Szepesvári]] ('''2009'''). ''Exploration-exploitation trade-off using variance estimates in multi-armed bandits''. Theoretical Computer Science, 410:1876-1902, 2009, [http://www.ualberta.ca/%7Eszepesva/papers/ucbtuned-journal.pdf pdf]
* [[Guillaume Chaslot]], [[Christophe Fiter]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2009'''). ''Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search''. [[Advances in Computer Games 12]], [http://www.personeel.unimaas.nl/g-chaslot/papers/acg09.pdf pdf], [http://www.lri.fr/%7Erimmel/publi/EK_explo.pdf pdf]
* [[Guillaume Chaslot]], [[Jean-Baptiste Hoock]], [[Julien Pérez]], [[Arpad Rimmel]], [[Olivier Teytaud]], [[Mark Winands]] ('''2009'''). ''Meta Monte-Carlo Tree Search for Automatic Opening Book Generation''. [http://www.personeel.unimaas.nl/m-winands/documents/ouvertures9x9.pdf pdf]
* [[Markus Enzenberger]] and [[Martin Müller]] ('''2009'''). ''A lock-free multithreaded Monte-Carlo tree search algorithm'', [[Advances in Computer Games 12]], [http://webdocs.cs.ualberta.ca/%7Emmueller/ps/enzenberger-mueller-acg12.pdf pdf]
* [[Markus Enzenberger]] and [[Martin Müller]] ('''2009'''). ''[http://www.cs.ualberta.ca/research/theses-publications/technical-reports/2009/tr09-08 Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search]'', [http://www.cs.ualberta.ca/system/files/tech_report/2009/TR09-08.pdf pdf]
* [[Rémi Coulom]] ('''2009'''). ''The Monte-Carlo Revolution in Go''. JFFoS'2008: Japanese-French Frontiers of Science Symposium, [http://remi.coulom.free.fr/JFFoS/JFFoS.pdf slides as pdf]
* [[Mark Winands]] and [[Yngvi Björnsson]] ('''2009'''). ''Evaluation Function Based Monte-Carlo LOA''. [http://www.ru.is/faculty/yngvi/pdf/WinandsB09.pdf pdf] <ref>[http://www.open-chess.org/viewtopic.php?f=5&t=886 Monte Carlo in LOA] by [[Mark Watkins]], [[Computer Chess Forums|Open Chess Forum]], December 30, 2010</ref>
* [[Tristan Cazenave]] ('''2009'''). ''Nested Monte-Carlo Search''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2009.html#Cazenave09 IJCAI 2009], [http://www.lamsade.dauphine.fr/~cazenave/papers/nested.pdf pdf]
* [[Paolo Ciancarini]], [[Gian Piero Favini]] ('''2009'''). ''Monte Carlo Tree Search Techniques in the Game of Kriegspiel''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2009.html IJCAI 2009], [http://ijcai.org/papers09/Papers/IJCAI09-086.pdf pdf] » [[KriegSpiel]]
* [[Tristan Cazenave]] ('''2009'''). ''Monte-Carlo Kakuro''. [[Advances in Computer Games 12]], [http://www.lamsade.dauphine.fr/~cazenave/papers/kakuro.pdf pdf]
* [[István Szita]], [[Guillaume Chaslot]], [[Pieter Spronck]] ('''2009'''). ''Monte-Carlo Tree Search in Settlers of Catan''. [[Advances in Computer Games 12]], [http://ticc.uvt.nl/~pspronck/pubs/ACG12Szita.pdf pdf] <ref>[https://en.wikipedia.org/wiki/The_Settlers_of_Catan The Settlers of Catan from Wikipedia]</ref>
* [[Tristan Cazenave]], [[Nicolas Jouandeau]] ('''2009'''). ''Parallel Nested Monte-Carlo Search''. NIDISC 2009, [http://www.lamsade.dauphine.fr/%7Ecazenave/papers/parallelNested.pdf pdf]
* [[Tomas Kozelek]] ('''2009'''). ''Methods of MCTS and the game Arimaa''. Master's thesis, [http://arimaa.com/arimaa/papers/TomasKozelekThesis/mt.pdf pdf] » [[Arimaa]]
* [[Kenta Sasaki]], [[Yoshiyuki Kotani]] ('''2009'''). ''Monte-Carlo Tree Search in the Game of Blokus-Duo''. [[Conferences#GPW|14th Game Programming Workshop]] <ref>[https://en.wikipedia.org/wiki/Blokus#Blokus_Duo.2FTravel_Blokus Blokus Duo from Wikipedia]</ref>
* [[David Silver]], [[Gerald Tesauro]] ('''2009'''). ''Monte-Carlo Simulation Balancing''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2009.html#SilverT09 ICML 2009], [http://www.machinelearning.org/archive/icml2009/papers/500.pdf pdf]
* [[Keh-Hsun Chen|Ken Chen]], [[Dawei Du]], [[Peigang Zhang]] ('''2009'''). ''Monte-Carlo Tree Search and Computer Go''. [http://www.informatik.uni-trier.de/~ley/db/series/sci/sci251.html#ChenDZ09 Advances in Information and Intelligent Systems 2009]
* [[David Silver]] ('''2009'''). ''Reinforcement Learning and Simulation-Based Search''. Ph.D. thesis, [[University of Alberta]], [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/thesis.pdf pdf]
* [[Seth Pellegrino]], [[Andrew Hubbard]], [[Jason Galbraith]], [[Peter D. Drake]], [[Yung-Pin Chen]] ('''2009'''). ''Localizing Search in Monte-Carlo Go using Statistical Covariance.'' [[ICGA Journal#32_3|ICGA Journal, Vol. 32, No. 3]]
==2010 ...==
* [[Julien Kloetzer]] ('''2010'''). ''[https://dspace.jaist.ac.jp/dspace/handle/10119/8867?locale=en Monte-Carlo Techniques: Applications to the Game of the Amazons]''. Ph.D. thesis, [[JAIST]]
* [[Yoshikuni Sato]], [[Daisuke Takahashi]] and [[Reijer Grimbergen]] ('''2010'''). ''A Shogi Program based on Monte-Carlo Tree Search''. [[ICGA Journal#33_2|ICGA Journal, Vol. 33, No. 2]]
* [[Richard J. Lorentz]] ('''2010'''). ''[http://www.springerlink.com/content/p4x16832317r1214/ Improving Monte-Carlo Tree Search in Havannah]''. [[CG 2010]]
* [[Amine Bourki]], [[Guillaume Chaslot]], [[Matthieu Coulm]], [[Vincent Danjean]], [[Hassen Doghmen]], [[Thomas Hérault]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Fabien Teytaud]], [[Olivier Teytaud]], [[Paul Vayssière]], [[Ziqin Yu]] ('''2010'''). ''[http://hal.inria.fr/inria-00512854/en/ Scalability and Parallelization of Monte-Carlo Tree Search]''. [[CG 2010]], [http://hal.inria.fr/docs/00/51/28/54/PDF/newcluster.pdf pdf]
* [[Julien Kloetzer]] ('''2010'''). ''Monte-Carlo Opening Books for Amazons''. [[CG 2010]]
* [[Arpad Rimmel]], [[Fabien Teytaud]], [[Olivier Teytaud]] ('''2010'''). ''[http://hal.inria.fr/inria-00485555/en/ Biasing Monte-Carlo Simulations through RAVE Values]''. [[CG 2010]], [http://hal.inria.fr/docs/00/48/55/55/PDF/poolrave.pdf pdf]
* [[Jean-Yves Audibert]] ('''2010'''). ''PAC-Bayesian aggregation and multi-armed bandits''. Habilitation thesis, [http://fr.wikipedia.org/wiki/Universit%C3%A9_Paris-Est Université Paris Est], [http://certis.enpc.fr/%7Eaudibert/Mes%20articles/hdr.pdf pdf], [http://certis.enpc.fr/%7Eaudibert/Mes%20articles/hdrSlides.pdf slides as pdf]
* [[Shih-Chieh Huang]], [[Rémi Coulom]], [[Shun-Shii Lin]] ('''2010'''). ''[http://remi.coulom.free.fr/CG2010-Simulation-Balancing/ Monte-Carlo Simulation Balancing in Practice]''. [[CG 2010]], [http://remi.coulom.free.fr/CG2010-Simulation-Balancing/SimulationBalancing.pdf pdf]
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Score Bounded Monte-Carlo Tree Search''. [[CG 2010]], [http://www.lamsade.dauphine.fr/~cazenave/papers/mcsolver.pdf pdf]
* [[Pim Nijssen]], [[Mark Winands]] ('''2010'''). ''Enhancements for Multi-Player Monte-Carlo Tree Search''. [[CG 2010]], [http://www.personeel.unimaas.nl/pim.nijssen/pub/cg10.pdf pdf]
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017</ref>
* [[Shih-Chieh Huang]], [[Rémi Coulom]], [[Shun-Shii Lin]] ('''2010'''). ''Monte-Carlo Simulation Balancing applied to 9x9 Go''. [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]
* [[Tristan Cazenave]], [[Abdallah Saffidine]] ('''2010'''). ''Monte-Carlo Hex''. [http://www.lamsade.dauphine.fr/~cazenave/papers/hex.pdf pdf]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2010'''). ''Combining UCT and Nested Monte-Carlo Search for Single-Player General Game Playing''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://www.lamsade.dauphine.fr/~cazenave/papers/ggp2009.pdf pdf 2009] » [[General Game Playing]]
* [[Broderick Arneson]], [[Ryan Hayward]], [[Philip Henderson]] ('''2010'''). ''Monte Carlo Tree Search in Hex''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4, [http://webdocs.cs.ualberta.ca/~hayward/papers/mcts-hex.pdf pdf]
* [[Hendrik Baier]], [[Peter D. Drake]] ('''2010'''). ''The power of forgetting: Improving the last-good-reply policy in Monte Carlo Go''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 2, No. 4
* [[Ingo Althöfer]] ('''2010'''). ''Game Self-Play with Pure Monte-Carlo: The Basin Structure''. [http://www.althofer.de/monte-carlo-basins-althoefer.pdf pdf]
* [[Fabien Teytaud]], [[Olivier Teytaud]] ('''2010'''). ''[http://hal.inria.fr/inria-00495078/en/ On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms]''. [http://hal.inria.fr/docs/00/49/50/78/PDF/cig2010.pdf pdf]
* [[Guillaume Chaslot]] ('''2010'''). ''Monte-Carlo Tree Search''. Ph.D. Thesis, [[Maastricht University]], [http://www.unimaas.nl/games/files/phd/Chaslot_thesis.pdf pdf]
* [[Jahn-Takeshi Saito]] ('''2010'''). ''Solving Difficult Game Positions''. Ph.D. Thesis, [[Maastricht University]], [http://www.unimaas.nl/games/files/phd/Saito_thesis.pdf pdf]
* [[Romaric Gaudel]], [[Michèle Sebag]] ('''2010'''). ''Feature Selection as a one-player game''. [http://www.icml2010.org/ ICML 2010], [http://www.icml2010.org/papers/247.pdf pdf]
* [[Hendrik Baier]] ('''2010'''). ''Adaptive Playout Policies for Monte-Carlo Go''. Master's thesis, [https://en.wikipedia.org/wiki/University_of_Osnabr%C3%BCck University of Osnabrück], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/master/2010/Baier_Hendrik.pdf pdf]
* [[Thomas J. Walsh]], [[Sergiu Goschin]], [[Michael L. Littman]] ('''2010'''). ''Integrating sample-based planning and model-based reinforcement learning.'' [[AAAI]], [https://pdfs.semanticscholar.org/bdc9/bfb6ecc6fb5afb684df03d7220c46ebdbf4e.pdf pdf] » [[UCT]], [[Reinforcement Learning]]
'''2011'''
* [[Shih-Chieh Huang]], [[Rémi Coulom]], [[Shun-Shii Lin]] ('''2011'''). ''Time Management for Monte-Carlo Tree Search Applied to the Game of Go''. TAAI 2010, [http://remi.coulom.free.fr/Publications/TimeManagement.pdf pdf]
* [[Arpad Rimmel]], [[Fabien Teytaud]], [[Tristan Cazenave]] ('''2011'''). ''Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows''. Evostar 2011, [http://www.lamsade.dauphine.fr/~cazenave/papers/tsptw.pdf pdf]
* [[Cameron Browne]] ('''2011'''). ''The Dangers of Random Playouts''. [[ICGA Journal#34_1|ICGA Journal, Vol. 34, No. 1]]
* [[Jean Méhat]], [[Tristan Cazenave]] ('''2011'''). ''A Parallel General Game Player''. [http://www.kuenstliche-intelligenz.de/ KI Journal], Vol. 25, No. 1, [http://www.lamsade.dauphine.fr/~cazenave/papers/rootparallelggp.pdf pdf]
* [[Shih-Chieh Huang]] ('''2011'''). ''New Heuristics for Monte Carlo Tree Search Applied to the Game of Go''. Ph.D. thesis, [http://www.usgo.org/resources/downloads/Supercomputer%20Go%20Appendix%20Two.pdf pdf]
* [[Petr Baudiš]] ('''2011'''). ''Information Sharing in MCTS''. Master thesis, Faculty of Mathematics and Physics, [https://en.wikipedia.org/wiki/Charles_University_in_Prague Charles University in Prague], [http://pasky.or.cz/go/prace.pdf pdf]
* [[Petr Baudiš]] ('''2011'''). ''Balancing MCTS by Dynamically Adjusting the Komi Value''. [[ICGA Journal#34_3|ICGA Journal, Vol. 34, No. 3]]
* [[Richard J. Lorentz]] ('''2011'''). ''Experiments with Monte-Carlo Tree Search in the Game of Havannah''. [[ICGA Journal#34_3|ICGA Journal, Vol. 34, No. 3]]
* [[Kazuki Yoshizoe]], [[Akihiro Kishimoto]], [[Tomoyuki Kaneko]], [[Haruhiro Yoshimoto]], [[Yutaka Ishikawa]] ('''2011'''). ''Scalable Distributed Monte Carlo Tree Search''. [http://www.informatik.uni-trier.de/~ley/db/conf/socs/socs2011.html#YoshizoeKKYI11 SoCS2011], [http://www.is.titech.ac.jp/~kishi/pdf_file/socs2011pmcts.pdf pdf]
* [[Cheng-Wei Chou]], [[Olivier Teytaud]], [[Shi-Jim Yen]] ('''2011'''). ''Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo''. [http://www.informatik.uni-trier.de/~ley/db/conf/evoW/evoappl2011-1.html#ChouTY11 EvoApplications 2011] <ref>[http://www.grappa.univ-lille3.fr/icga/game.php?id=47 NoGo (ICGA Tournaments)]</ref>
* [[Shi-Jim Yen]], [[Jung-Kuei Yang]] ('''2011'''). ''Two-Stage Monte Carlo Tree Search for Connect6''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 3
* [[Nozomu Ikehata]], [[Takeshi Ito]] ('''2011'''). ''Monte-Carlo Tree Search In Ms. Pac-Man''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 3 <ref>[https://en.wikipedia.org/wiki/Ms._Pac-Man Ms. Pac-Man from Wikipedia]</ref>
* [[Junichi Hashimoto]], [[Akihiro Kishimoto]], [[Kazuki Yoshizoe]], [[Kokolo Ikeda]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_1 Accelerated UCT and Its Application to Two-Player Games]''. [[Advances in Computer Games 13]]
* [[Jan Stankiewicz]], [[Mark Winands]], [[Jos Uiterwijk]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_6 Monte-Carlo Tree Search Enhancements for Havannah]''. [[Advances in Computer Games 13]]
* [[Gabriel Van Eyck]], [[Martin Müller]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_2 Revisiting Move Groups in Monte-Carlo Tree Search]''. [[Advances in Computer Games 13]]
* [[Hendrik Baier]], [[Mark Winands]] ('''2011'''). ''Active Opening Book Application for Monte-Carlo Tree Search in 19x19 Go''. [http://allserv.kahosl.be/bnaic2011/ BNAIC 2011], [https://dke.maastrichtuniversity.nl/m.winands/documents/bnaic2011Baier.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_4 Time Management for Monte-Carlo Tree Search in Go]''. [[Advances in Computer Games 13]]
* [[Richard J. Lorentz]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_5 An MCTS Program to Play EinStein Würfelt Nicht!]'' [[Advances in Computer Games 13]]
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Hassen Doghmen]], [[Chang-Shing Lee]], [[Tsan-Cheng Su]], [[Fabien Teytaud]], [[Olivier Teytaud]], [[Hui-Ming Wang]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_8 Towards a Solution of 7x7 Go with Meta-MCTS]''. [[Advances in Computer Games 13]]
* [[Bruno Bouzy]], [[Marc Métivier]], [[Damien Pellier]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007/978-3-642-31866-5_9 MCTS Experiments on the Voronoi Game]''. [[Advances in Computer Games 13]]
* [[Pim Nijssen]], [[Mark Winands]] ('''2011'''). ''Playout Search for Monte-Carlo Tree Search in Multi-Player Games''. [[Advances in Computer Games 13]]
* [[Jiao Wang]], [[Shiyuan Li]], [[Jitong Chen]], [[Xin Wei]], [[Huizhan Lv]], [[Xinhe Xu]] ('''2011'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-31866-5_10?LI=true#page-1 4*4-Pattern and Bayesian Learning in Monte-Carlo Go]''. [[Advances in Computer Games 13]]
* [[Jeff Rollason]] ('''2011'''). ''[http://www.aifactory.co.uk/newsletter/2011_02_mcts_static.htm Mixing MCTS with Conventional Static Evaluation: Experiments and shortcuts en-route to full UCT]''. [[AI Factory]], Winter 2011 » [[UCT]], [[Evaluation]]
* [[Sylvain Gelly]], [[David Silver]] ('''2011'''). ''Monte-Carlo tree search and rapid action value estimation in computer Go''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 175, No. 11
* [[Lars Schaefers]], [[Marco Platzner]], [[Ulf Lorenz]] ('''2011'''). ''UCT-Treesplit - Parallel MCTS on Distributed Memory''. MCTS Workshop, Freiburg, Germany, [http://www.cs.uni-paderborn.de/fileadmin/Informatik/AG-Platzner/People/Schaefers/TreesplitICAPS.pdf pdf]
* [[Tobias Graf]], [[Ulf Lorenz]], [[Marco Platzner]], [[Lars Schaefers]] ('''2011'''). ''Parallel Monte-Carlo Tree Search for HPC Systems''. [http://www.informatik.uni-trier.de/~ley/db/conf/europar/europar2011-2.html Euro-Par 2011], [http://www.cs.uni-paderborn.de/fileadmin/Informatik/AG-Platzner/People/Schaefers/uctTreesplit.pdf pdf]
* [[Joel Veness]], [[Marc Lanctot]], [[Michael Bowling]] ('''2011'''). ''Variance Reduction in Monte-Carlo Tree Search''. [http://papers.nips.cc/book/advances-in-neural-information-processing-systems-24-2011 NIPS], [http://papers.nips.cc/paper/4288-variance-reduction-in-monte-carlo-tree-search.pdf pdf]
'''2012'''
* [[Michael L. Littman]] ('''2012'''). ''Technical Perspective: A New Way to Search Game Trees''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
* [[Oleg Arenz]] ('''2012'''). ''Monte Carlo Chess''. B.Sc. thesis, [[Darmstadt University of Technology]], advisor [[Johannes Fürnkranz]], [http://www.ke.tu-darmstadt.de/lehre/arbeiten/bachelor/2012/Arenz_Oleg.pdf pdf] » [[Stockfish]]
* [[Jeff Rollason]] ('''2012'''). ''[http://www.aifactory.co.uk/newsletter/2012_01_tuning_spades.htm Tuning Spades]''. [[AI Factory]], Summer 2012 » [[UCT]]
* [[Tristan Cazenave]], [[Fabien Teytaud]] ('''2012'''). ''Beam Nested Rollout Policy Adaptation''. [[ECAI CGW 2012]]
* [[André Fabbri]], [[Frédéric Armetta]], [[Eric Duchêne]], [[Salima Hassas]] ('''2012'''). ''A new self-acquired knowledge process for Monte Carlo Tree Search''. [[ECAI CGW 2012]]
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]] ('''2012'''). ''Sparse Sampling for Adversarial Games''. [[ECAI CGW 2012]]
* [[Niek Den Teuling]], [[Mark Winands]] ('''2012'''). ''Monte-Carlo Tree Search for the Simultaneous Move Game Tron''. [[ECAI CGW 2012]], [https://dke.maastrichtuniversity.nl/m.winands/documents/Tronpaper.pdf pdf]
* [[Jan Kuipers (Nikhef)|Jan Kuipers]], [[Aske Plaat]], [[Jos Vermaseren]], [[Jaap van den Herik]] ('''2012'''). ''Improving multivariate Horner schemes with Monte Carlo tree search''. [http://arxiv.org/abs/1207.7079 CoRR abs/1207.7079]
* [[Cameron Browne]], [[Edward Powley]], [[Daniel Whitehouse]], [[Simon Lucas]], [[Peter Cowling]], [[Philipp Rohlfshagen]], [[Stephen Tavener]], [[Diego Perez]], [[Spyridon Samothrakis]], [[Simon Colton]] ('''2012'''). ''[http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6145622&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F4804728%2F6169178%2F06145622.pdf%3Farnumber%3D6145622 A Survey of Monte Carlo Tree Search Methods]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 4, No. 1
* [[Pim Nijssen]], [[Mark Winands]] ('''2012'''). ''[http://ieeexplore.ieee.org/document/6266709/ Monte-Carlo Tree Search for the Hide-and-Seek Game Scotland Yard]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 4, No. 4 <ref>[https://en.wikipedia.org/wiki/Scotland_Yard_%28board_game%29 Scotland Yard (board game) from Wikipedia]</ref>
* [[Hendrik Baier]], [[Mark Winands]] ('''2012'''). ''Nested Monte-Carlo Tree Search for Online Planning in Large MDPs''. [http://www2.lirmm.fr/ecai2012/ ECAI 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/ecai2012.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2012'''). ''Beam Monte-Carlo Tree Search''. [http://dblp.uni-trier.de/db/conf/cig/cig2012.html#BaierW12 CIG 2012], [https://dke.maastrichtuniversity.nl/m.winands/documents/CIG2012_paper_32.pdf pdf]
* [[Adrien Couetoux]], [[Olivier Teytaud]], [[Hassen Doghmen]] ('''2012'''). ''Learning a Move-Generator for Upper Confidence Trees''. [http://ics2012.ndhu.edu.tw/ ICS 2012], [https://en.wikipedia.org/wiki/Hualien_City Hualien], [https://en.wikipedia.org/wiki/Taiwan Taiwan], December 2012
'''2013'''
* [[Cheng-Wei Chou]], [[Ping-Chiang Chou]], [[Chang-Shing Lee]], [[David L. Saint-Pierre]], [[Olivier Teytaud]], [[Mei-Hui Wang]], [[Li-Wen Wu]], [[Shi-Jim Yen]] ('''2013'''). ''Strategic Choices: Small Budgets and Simple Regret''. [[TAAI|TAAI 2012]], [http://www.csie.ndhu.edu.tw/csieweb/en/node/685 Excellent Paper Award], [https://hal.inria.fr/hal-00753145v2/document pdf]
* [[Daniel Shawul|Daniel S. Abdi]] ('''2013'''). ''Monte carlo methods for estimating game tree size''. [https://dl.dropboxusercontent.com/u/55295461/perft/perft.pdf pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=47740&topic_view=flat&start=11 Re: MC methods] by [[Daniel Shawul]], [[CCC]], April 13, 2013</ref> » [[Perft]]
* [[Marc Lanctot]] ('''2013'''). ''Monte Carlo Sampling and Regret Minimization for Equilibrium Computation and Decision-Making in Large Extensive Form Games''. Ph.D. thesis, [[University of Alberta]], advisor [[Michael Bowling]]
* [[Aviezri Fraenkel]] ('''2013'''). ''Reflection''. [[ICGA Journal#36_1|ICGA Journal, Vol. 36, No. 1]] » [[Stanislaw Ulam]]
* [[Jeff Rollason]] ('''2013'''). ''[http://www.aifactory.co.uk/newsletter/2013_01_reduce_burden.htm Reducing the burden of knowledge: Simulation-based methods in imperfect information games]''. [[AI Factory]], Summer 2013
* [[Abdallah Saffidine]] ('''2013'''). ''Solving Games and All That''. Ph.D. thesis, 2.5 Monte Carlo Tree Search
* [[Shih-Chieh Huang]], [[Martin Müller]] ('''2013'''). '' Investigating the Limits of Monte Carlo Tree Search Methods in Computer Go''. [[CG 2013]]
* [[Shih-Chieh Huang]], [[Broderick Arneson]], [[Ryan Hayward]], [[Martin Müller]], [[Jakub Pawlewicz]] ('''2013'''). ''MoHex 2.0: a pattern-based MCTS Hex player''. [[CG 2013]], [https://webdocs.cs.ualberta.ca/~hayward/papers/m2.pdf pdf]
* [[Tobias Graf]], [[Lars Schaefers]], [[Marco Platzner]] ('''2013'''). ''On Semeai Detection in Monte-Carlo Go''. [[CG 2013]], [http://www.cs.uni-paderborn.de/fileadmin/Informatik/AG-Platzner/publications/graf13_cg/graf13_cg.pdf pdf]
* [[Richard J. Lorentz]], [[Therese Horey]] ('''2013'''). ''Programming Breakthrough''. [[CG 2013]] » [[Breakthrough (Game)]]
* [[Ingo Althöfer]], [[Wesley Turner]] ('''2013'''). ''Anomalies of Pure Monte Carlo Search in Monte Carlo Perfect Games''. [[CG 2013]]
* [[Simon Viennot]], [[Kokolo Ikeda]] ('''2013'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-319-09165-5_3 Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search]''. [[CG 2013]]
* [[Sumudo Fernando]], [[Martin Müller]] ('''2013'''). ''Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go''. [[CG 2013]]
* [[Ingo Althöfer]] ('''2013'''). ''The wild Years are gone: Monte Carlo in Smoother Waters''. Conference Report [[CG 2013]], [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]]
* [[Marc Lanctot]], [[Abdallah Saffidine]], [[Joel Veness]], [[Christopher Archibald]], [[Mark Winands]] ('''2013'''). ''Monte Carlo *-Minimax Search''. [[Conferences#IJCAI|IJCAI 2013]]
* [[Pim Nijssen]] ('''2013'''). ''Monte-Carlo Tree Search for Multi-Player Games''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Nijssen_thesis.pdf pdf]
* [[Jeff Rollason]] ('''2013'''). ''[http://www.aifactory.co.uk/newsletter/2013_02_unknown_mcts.htm Searching the Unknown with MCTS]''. [[AI Factory]], Winter 2013
* [[David Silver]], [[Richard Sutton]], [[Martin Müller|Martin Mueller]] ('''2013'''). ''Temporal-Difference Search in Computer Go''. [http://icaps13.icaps-conference.org/technical-program/workshop-program/planning-and-learning/ ICAPS-13], [http://webdocs.cs.ualberta.ca/~sutton/papers/SSM-ICAPS-13.pdf pdf]
* [[Hendrik Baier]], [[Mark Winands]] ('''2013'''). ''Monte-Carlo Tree Search and minimax hybrids''. [http://dblp.uni-trier.de/db/conf/cig/cig2013.html#BaierW13 CIG 2013], [https://dke.maastrichtuniversity.nl/m.winands/documents/paper%2049.pdf pdf]
* [[Timothy Furtak]], [[Michael Buro]] ('''2013'''). ''Recursive Monte Carlo search for imperfect information games''. [[IEEE#CIG|CIG 2013]], [https://skatgame.net/mburo/ps/recmc13.pdf pdf]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2013'''). ''Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification''. [http://arxiv.org/abs/1312.0841 CoRR abs/1312.0841]
* [[Arthur Guez]], [[David Silver]], [[Peter Dayan]] ('''2013'''). ''Scalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research Journal of Artificial Intelligence Research], Vol. 48, [https://www.jair.org/media/4117/live-4117-7507-jair.pdf pdf]
* [[Ari Weinstein]], [[Michael L. Littman]], [[Sergiu Goschin]] ('''2013'''). ''[http://proceedings.mlr.press/v24/weinstein12a.html Rollout-based Game-tree Search Outprunes Traditional Alpha-beta]''. [http://proceedings.mlr.press/ PMLR], Vol. 24 » [[UCT]]
'''2014'''
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''HEPGAME and the Simplification of Expressions''. [http://arxiv.org/abs/1405.6369 CoRR abs/1405.6369]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2014'''). ''Performance analysis of a 240 thread tournament level MCTS Go program on the Intel Xeon Phi''. [http://arxiv.org/abs/1409.4297 CoRR abs/1409.4297] » [[Go]], [[Parallel Search]], [[x86-64]]
* [[Ben Ruijl]], [[Jos Vermaseren]], [[Aske Plaat]], [[Jaap van den Herik]] ('''2014'''). ''Why Local Search Excels in Expression Simplification''. [http://arxiv.org/abs/1409.5223 CoRR abs/1409.5223]
* [[Lars Schaefers]] ('''2014'''). ''Parallel Monte-Carlo Tree Search for HPC Systems and its Application to Computer Go''. Ph.D. thesis, [[University of Paderborn]], advisors [[Marco Platzner]], [[Ulf Lorenz]], [http://www.althofer.de/phd-thesis-schaefers.pdf pdf], [https://www.dropbox.com/s/x0lh7ky5lvj6c1y/PhdThesisSchaefers.pdf pdf]
* [[Rémi Munos]] ('''2014'''). ''From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning''. [http://dblp.uni-trier.de/db/journals/ftml/ftml7.html#Munos14 Foundations and Trends in Machine Learning, Vol. 7, No 1], [https://hal.archives-ouvertes.fr/hal-00747575 hal-00747575v5], [http://chercheurs.lille.inria.fr/~munos/papers/files/AAAI2013_slides.pdf slides as pdf]
* [[David W. King]] ('''2014'''). ''Complexity, Heuristic, and Search Analysis for the Games of Crossings and Epaminondas''. Masters thesis, [https://en.wikipedia.org/wiki/Air_Force_Institute_of_Technology Air Force Institute of Technology], [http://www.afit.edu/docs/AFIT-ENG-14-M-44_King.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Crossings_%28game%29 Crossings from Wikipedia]</ref>
* [[David W. King]], [[Gilbert L. Peterson]] ('''2014'''). ''Epaminondas: Exploring Combat Tactics''. [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]] <ref> [https://en.wikipedia.org/wiki/Epaminondas_%28game%29 Epaminondas from Wikipedia]</ref>
* [[Ting-Fu Liao]], [[I-Chen Wu]], [[Guan-Wun Chen]], [[Chung-Chin Shih]], [[Po-Ya Kang]], [[Bing-Tsung Chiang]], [[Ting-Chu Ho]], [[Ti-Rong Wu]] ('''2014'''). ''A Study of Software Framework for Parallel Monte Carlo Tree Search''. [[Conferences#GPW19|GPW-2014]]
* [[Hendrik Baier]], [[Mark Winands]] ('''2014'''). ''Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions''. [[ECAI CGW 2014]]
* [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2014'''). ''Small and Large MCTS Playouts applied to Chinese Dark Chess Stochastic Game''. [[ECAI CGW 2014]]
* [[Tom Pepels]], [[Tristan Cazenave]], [[Mark Winands]], [[Marc Lanctot]] ('''2014'''). ''Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search''. [[ECAI CGW 2014]]
* [[Denis Robilliard]], [[Cyril Fonlupt]], [[Fabien Teytaud]] ('''2014'''). ''Monte-Carlo Tree Search for the Game of “7 Wonders”''. [[ECAI CGW 2014]] <ref>[https://en.wikipedia.org/wiki/7_Wonders_%28board_game%29 7 Wonders (board game) from WIkipedia]</ref>
* [[Johannes Heinrich]], [[David Silver]] ('''2014'''). ''[https://www.aaai.org/ocs/index.php/WS/AAAIW14/paper/view/8811 Self-Play Monte-Carlo Tree Search in Computer Poker]''. [[AAAI|AAAI-14 Workshop]]
==2015 ...==
* [[Richard J. Lorentz]] ('''2015'''). ''Early Playout Termination in MCTS''. [[Advances in Computer Games 14]]
* [[Tristan Cazenave]] ('''2015'''). ''Playout Policy Adaptation for Games''. [[Advances in Computer Games 14]]
* [[Tobias Graf]], [[Marco Platzner]] ('''2015'''). ''Adaptive Playouts in Monte Carlo Tree Search with Policy Gradient Reinforcement Learning''. [[Advances in Computer Games 14]]
* [[Chu-Hsuan Hsueh]], [[I-Chen Wu]], [[Wen-Jie Tseng]], [[Shi-Jim Yen]], [[Jr-Chang Chen]] ('''2015'''). ''Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program''. [[Advances in Computer Games 14]]
* [[Yusaku Mandai]], [[Tomoyuki Kaneko]] ('''2015'''). ''LinUCB Applied to Monte Carlo Tree Search''. [[Advances in Computer Games 14]]
* [[Yun-Ching Liu]], [[Yoshimasa Tsuruoka]] ('''2015'''). ''Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search''. [[Advances in Computer Games 14]]
* [[Jiao Wang]], [[Tan Zhu]], [[Hongye Li]], [[Chu-Hsuan Hsueh]], [[I-Chen Wu]] ('''2015'''). ''Belief-state Monte-Carlo tree search for Phantom games''. [http://dblp.uni-trier.de/db/conf/cig/cig2015.html#WangZLHW15 CIG 2015]
* [[Fabien Teytaud]], [[Julien Dehos]] ('''2015'''). ''On the Tactical and Strategic Behaviour of MCTS when Biasing Random Simulations''. [[ICGA Journal#38_2|ICGA Journal, Vol. 38, No. 2]]
* [[Jeff Rollason]] ('''2015'''). ''[http://www.aifactory.co.uk/newsletter/2015_02_mixing_immiscible.htm Mixing the Immiscible - MCTS and evaluation]''. [[AI Factory]], October 2015 <ref>[[Guillaume Chaslot]], [[Mark Winands]], [[Jos Uiterwijk]], [[Jaap van den Herik]], [[Bruno Bouzy]] ('''2008'''). ''Progressive Strategies for Monte-Carlo Tree Search''. [http://www.worldscinet.com/nmnc/nmnc.shtml New Mathematics and Natural Computation], Vol. 4, No. 3, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.106.3015&rep=rep1&type=pdf pdf]</ref>
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Scaling Monte Carlo Tree Search on Intel Xeon Phi''. [http://arxiv.org/abs/1507.04383 CoRR abs/1507.04383] » [[Hex]], [[Parallel Search]], [[x86-64]]
* [[S. Ali Mirsoleimani]], [[Aske Plaat]], [[Jaap van den Herik]], [[Jos Vermaseren]] ('''2015'''). ''Parallel Monte Carlo Tree Search from Multi-core to Many-core Processors''. [https://whova.com/portal/ieeet_201508/ TrustCom/BigDataSE/|ISPA 2015], [https://askeplaat.files.wordpress.com/2013/01/ispa2015.pdf pdf]
* [[Peter H. Jin]], [[Kurt Keutzer]] ('''2015'''). ''Convolutional Monte Carlo Rollouts in Go''. [http://arxiv.org/abs/1512.03375 arXiv:1512.03375]
* [[Naoki Mizukami]], [[Yoshimasa Tsuruoka]] ('''2015'''). ''Building a Computer Mahjong Player Based on Monte Carlo Simulation and Opponent Models''. [[IEEE#TOCIAIGAMES|IEEE CIG 2015]], [http://www.logos.ic.i.u-tokyo.ac.jp/~mizukami/paper/cig_2015.pdf pdf]
* [[Hendrik Baier]] ('''2015'''). ''Monte-Carlo Tree Search Enhancements for One-Player and Two-Player Domains''. Ph.D. thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Baier_thesis.pdf pdf] <ref>[[Dap Hartmann]] ('''2017'''). ''Let's Catch the Train to Monte-Carlo''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]]</ref>
* [[Lars Schaefers]], [[Marco Platzner]] ('''2015'''). ''[http://ieeexplore.ieee.org/document/6876158/ Distributed Monte Carlo Tree Search: A Novel Technique and its Application to Computer Go]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 7, No. 4 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66125&start=18 Re: Minmax backup operator for MCTS] by [[Brahim Hamadicharef]], [[CCC]], December 30, 2017</ref>
* [[Bojun Huang]] ('''2015'''). ''[https://www.semanticscholar.org/paper/Pruning-Game-Tree-by-Rollouts-Huang/a38b358745067f71a9c780db117ae2471e693d63 Pruning Game Tree by Rollouts]''. [[AAAI]] » [[SSS* and Dual*#SSStarandDualStarAsMT|MT-SSS*]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66280&start=67 Re: Announcing lczero] by [[Daniel Shawul]], [[CCC]], January 21, 2018 » [[LCZero]]</ref>
'''2016'''
* [[David Silver]], [[Shih-Chieh Huang|Aja Huang]], [[Chris J. Maddison]], [[Arthur Guez]], [[Laurent Sifre]], [[George van den Driessche]], [[Julian Schrittwieser]], [[Ioannis Antonoglou]], [[Veda Panneershelvam]], [[Marc Lanctot]], [[Sander Dieleman]], [[Dominik Grewe]], [[John Nham]], [[Nal Kalchbrenner]], [[Ilya Sutskever]], [[Timothy Lillicrap]], [[Madeleine Leach]], [[Koray Kavukcuoglu]], [[Thore Graepel]], [[Demis Hassabis]] ('''2016'''). ''[http://www.nature.com/nature/journal/v529/n7587/full/nature16961.html Mastering the game of Go with deep neural networks and tree search]''. [https://en.wikipedia.org/wiki/Nature_%28journal%29 Nature], Vol. 529 » [[AlphaGo]]
* [[Tobias Graf]], [[Marco Platzner]] ('''2016'''). ''Using Deep Convolutional Neural Networks in Monte Carlo Tree Search''. [[CG 2016]]
* [[Takahisa Imagawa]], [[Tomoyuki Kaneko]] ('''2016'''). ''Monte Carlo Tree Search with Robust Exploration''. [[CG 2016]]
* [[Joris Duguépéroux]], [[Ahmad Mazyad]], [[Fabien Teytaud]], [[Julien Dehos]] ('''2016'''). ''Pruning playouts in Monte-Carlo Tree Search for the game of Havannah''. [[CG 2016]]
* [[Peter H. Jin]], [[Kurt Keutzer]] ('''2016'''). ''Convolutional Monte Carlo Rollouts for Computer Go''. [[CG 2016]]
* [[Hendrik Baier]], [[Mark Winands]] ('''2016'''). ''Time Management for Monte Carlo Tree Search''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 8, No. 3, [https://dke.maastrichtuniversity.nl/m.winands/documents/time_management_for_monte_carlo_tree_search.pdf draft as pdf]
* [[Katsuki Ohto]], [[Tetsuro Tanaka]] ('''2016'''). ''Application of Monte Carlo Tree Search to Curling AI''. [[Conferences#GPW21|21st Game Programming Workshop]]
'''2017'''
* [[Dap Hartmann]] ('''2017'''). ''Let's Catch the Train to Monte-Carlo''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]], Review on [[Hendrik Baier#PhD|Hendrik Baier's Ph.D. thesis]]
* [[Katsuki Ohto]], [[Tetsuro Tanaka]] ('''2017'''). ''A Curling Agent Based on the Monte-Carlo Tree Search Considering the Similarity of the Best Action among Similar States''. [[Advances in Computer Games 15]]
* [[Naoki Mizukami]], [[Jun Suzuki]], [[Hirotaka Kameko]], [[Yoshimasa Tsuruoka]] ('''2017'''). ''Exploration Bonuses Based on Upper Confidence Bounds for Sparse Reward Games''. [[Advances in Computer Games 15]]
* [[David Silver]], [[Thomas Hubert]], [[Julian Schrittwieser]], [[Ioannis Antonoglou]], [[Matthew Lai]], [[Arthur Guez]], [[Marc Lanctot]], [[Laurent Sifre]], [[Dharshan Kumaran]], [[Thore Graepel]], [[Timothy Lillicrap]], [[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://arxiv.org/abs/1712.01815 arXiv:1712.01815] » [[AlphaZero]]
* [[Shantanu Thakoor]], [[Surag Nair]], [[Megha Jhunjhunwala]] ('''2017'''). ''Learning to Play Othello Without Human Knowledge''. [[Stanford University]], [https://github.com/suragnair/alpha-zero-general/blob/master/pretrained_models/writeup.pdf pdf] » [[AlphaZero]], [[Othello]], [[Deep Learning]] <ref>[https://github.com/suragnair/alpha-zero-general GitHub - suragnair/alpha-zero-general: A clean and simple implementation of a self-play learning algorithm based on AlphaGo Zero (any game, any framework!)]</ref>
* [[Hendrik Baier]] ('''2017'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-57969-6_5 A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta]''. [https://link.springer.com/book/10.1007%2F978-3-319-57969-6 Computer Games] » [[Bojun Huang#Rollout|Rollout Paradigm]]
* [[Tristan Cazenave]] ('''2017'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-57969-6_4 Nested Rollout Policy Adaptation with Selective Policies]''. [https://link.springer.com/book/10.1007%2F978-3-319-57969-6 Computer Games]
=Forum Posts=
==2010 ...==
* [https://groups.google.com/d/msg/computer-go-archive/JrrSovvgTV0/UbPOufyTApQJ [Computer-go] learning patterns for mc go] by [[Hendrik Baier]], [https://groups.google.com/forum/#!forum/computer-go-archive Computer Go Archive], April 26, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=38554 UCT surprise for checkers !] by [[Daniel Shawul]], [[CCC]], March 25, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41730 MCTS without random playout?] by [[Antonio Torrecillas]], [[CCC]], January 01, 2012 » [[B*]]
* [http://www.talkchess.com/forum/viewtopic.php?t=47740&topic_view=flat&start=11 Re: MC methods] by [[Daniel Shawul]], [[CCC]], April 13, 2013 » [[Perft]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=59118 monte carlo tree search question] by [[Marco Belli]], [[CCC]], January 31, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=61801 The scaling of Deep Learning MCTS Go engines] by [[Kai Laskos]], [[CCC]], October 23, 2016 » [[Deep Learning]], [[Go]], [[Monte-Carlo Tree Search|MCTS]]
'''2017'''
* [https://groups.google.com/forum/#!topic/fishcooking/AE4EgWQ20dY A branch to test the Monte Carlo algorithm in Stockfish] by Stephane Nicolet, [[Computer Chess Forums|FishCooking]], December 06, 2017 » [[Stockfish]], [[AlphaZero]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65964 Nebiyu-MCTS vs TSCP 1-0] by [[Daniel Shawul]], [[CCC]], December 10, 2017 » [[Nebiyu]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66013 An AlphaZero inspired project] by [[Truls Edvard Stokke]], [[CCC]], December 14, 2017 » [[AlphaZero]]
* [https://groups.google.com/d/msg/fishcooking/rMCfc8zMerc/F01WuNtDCgAJ MCTS wrapper for StockFish] by [[Jonathan Baxter]], [[Computer Chess Forums|FishCooking]], December 19, 2017 » [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66125 Search traps in MCTS and chess] by [[Daniel Shawul]], [[CCC]], December 25, 2017 » [[Raghuram Ramanujan#UCT|Sampling-Based Planning]]
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=32429 MCTS weakness wrt AB (via Daniel Shawul)] by [[Chris Whittington]], [[Computer Chess Forums|Rybka Forum]], December 25, 2017
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66414 Alpha-Beta as a rollouts algorithm] by [[Daniel Shawul]], [[CCC]], January 25, 2018 » [[Alpha-Beta]], [[MCαβ]], [[Scorpio]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66886 comparing minimax and averaging MCTS with alphabeta rollouts] by [[Daniel Shawul]], [[CCC]], March 20, 2018 » [[Scorpio]]
* [http://www.talkchess.com/forum/viewtopic.php?t=67235 MCTS beginner questions] by [[Martin Fierz]], [[CCC]], April 25, 2018
=External Links=
==Monte Carlo Tree Search==
* [https://en.wikipedia.org/wiki/Monte_Carlo_tree_search Monte Carlo tree search from Wikipedia]
* [http://senseis.xmp.net/?MonteCarlo Sensei's Library: Monte Carlo Tree Search]
* [http://senseis.xmp.net/?UCT Sensei's Library: UCT]
* [http://mcts.ai/index.html Monte Carlo Tree Search - Home] by [[Cameron Browne]]
* [http://www.althofer.de/lange-nacht-jena.html Lange Nacht der Wissenschaften - Long Night of Sciences Jena - 2007] by [[Ingo Althöfer]], [[Jakob Erdmann#UCT|MC and UCT poster]] by [[Jakob Erdmann]]
* [http://web.stanford.edu/~surag/posts/alphazero.html A Simple Alpha(Go) Zero Tutorial] by [[Surag Nair]], [[Stanford University]], December 29, 2017 » [[AlphaZero]], [[Deep Learning]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=66179 A Simple Alpha(Go) Zero Tutorial] by Oliver Roese, [[CCC]], December 30, 2017</ref>
: [https://github.com/suragnair/alpha-zero-general GitHub - suragnair/alpha-zero-general: A clean and simple implementation of a self-play learning algorithm based on AlphaGo Zero (any game, any framework!)]
==Monte Carlo Misc==
* [http://www.chessbase.com/newsdetail.asp?newsid=5075 Rybka's Monte Carlo analysis] by [[Steve Lopez]], [[ChessBase|ChessBase News]], February 03, 2009 » [[Rybka]]
* [https://en.wikipedia.org/wiki/Monte_Carlo_%28disambiguation%29 Monte Carlo (disambiguation) from Wikipedia]
: [https://en.wikipedia.org/wiki/Monte_Carlo_algorithm Monte Carlo algorithm]
: [https://en.wikipedia.org/wiki/Monte_Carlo_method Monte Carlo method]
: [https://en.wikipedia.org/wiki/Monte_Carlo Monte Carlo]
: [https://en.wikipedia.org/wiki/Monte_Carlo_Casino Monte Carlo Casino]
* [http://www.crapsdicecontrol.com/monte_carlo.htm A History of Monte Carlo]
* [http://www.dartmouth.edu/%7Erc/classes/soft_dev/C_simple_ex.html Software Development in the UNIX Environment - Example C Program to Compute PI Using A Monte Carlo Method]
* [http://www.eveandersson.com/pi/monte-carlo-circle Calculation of Pi Using the Monte Carlo Method] by [http://www.eveandersson.com/ Eve Astrid Andersson]
* [https://en.wikipedia.org/wiki/Slot_machine Slot machine from Wikipedia]
* [http://videolectures.net/icml09_silver_mcsb/ Monte-Carlo Simulation Balancing - videolectures.net] by [[David Silver]] <ref>[[David Silver]], [[Gerald Tesauro]] ('''2009'''). ''Monte-Carlo Simulation Balancing''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2009.html#SilverT09 ICML 2009], [http://www.machinelearning.org/archive/icml2009/papers/500.pdf pdf]</ref>
* [[Videos#MarcusMiller|Marcus Miller]] - [https://en.wikipedia.org/wiki/State_of_Mind_(Raul_Mid%C3%B3n_album) State of Mind] ([https://en.wikipedia.org/wiki/Ra%C3%BAl_Mid%C3%B3n Raúl Midón]), [https://fr.wikipedia.org/wiki/A_Night_in_Monte-Carlo A Night In Monte-Carlo] (2010), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: feat. [https://en.wikipedia.org/wiki/Ra%C3%BAl_Mid%C3%B3n Raúl Midón], [[Videos#RoyHargrove|Roy Hargrove]] and the [https://en.wikipedia.org/wiki/Monte-Carlo_Philharmonic_Orchestra Monte-Carlo Philharmonic Orchestra], November 29, 2008, [http://maboum.com/news-monte-carlo-jazz-festival-2008 Monte-Carlo Jazz Festival]
: {{#evu:https://www.youtube.com/watch?v=Gbc72rfyq94|alignment=left|valignment=top}}
=References=
<references />
'''[[Search|Up one level]]'''
