A survey of Monte Carlo tree search methods

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 4, Issue 1, 2012, Pages 1-43

  Browne, Cameron B ^a   Powley, Edward ^c   Whitehouse, Daniel ^c   Lucas, Simon M ^b   Cowling, Peter I ^c   Rohlfshagen, Philipp ^b   Tavener, Stephen ^a   Perez, Diego ^b   Samothrakis, Spyridon ^b   Colton, Simon ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF ESSEX   (United Kingdom)

^c UNIVERSITY OF BRADFORD   (United Kingdom)

Author keywords

Artificial intelligence (AI); bandit based methods; computer Go; game search; Monte Carlo tree search (MCTS); upper confidence bounds (UCB); upper confidence bounds for trees (UCT)

Indexed keywords

BANDIT-BASED METHODS; COMPUTER GO; GAME SEARCH; MONTE CARLO; UPPER CONFIDENCE BOUND;

SURVEYS;

ARTIFICIAL INTELLIGENCE;

EID: 84858960516     PISSN: 1943068X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCIAIG.2012.2186810     Document Type: Review

References (240)

1. B. Abramson, "Expected-outcome: A general model of static evaluation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 12, no. 2, pp. 182-193, Feb. 1990. (Pubitemid 20666142)
2. R. Agrawal, "Sample mean based index policies with zero (log n) regret for the multi-armed bandit problem," Adv. Appl. Probab., vol. 27, no. 4, pp. 1054-1078, 1995.
3. H. Akiyama, K. Komiya, and Y. Kotani, "Nested Monte-Carlo search with AMAF heuristic," in Proc. Int. Conf. Technol. Appl. Artif. Intell., Hsinchu, Taiwan, Nov. 2010, pp. 172-176.
4. L. V. Allis, M. van der Meulen, and H. J. van den Herik, "Proofnumber search," Artif. Intell., vol. 66, no. 1, pp. 91-124, 1994.
5. I. Althöfer, "On the laziness ofMonte-Carlo game tree search in nontight situations," Friedrich-Schiller Univ., Jena, Germany, Tech. Rep., 2008.
6. I. Althöfer, "Game self-play with pure Monte-Carlo: The basin structure Friedrich-Schiller Univ., Jena, Germany, Tech. Rep., 2010.
7. B. Arneson, R. B. Hayward, and P. Henderson, "MoHex wins hex tournament," Int. Comput. Games Assoc. J., vol. 32, no. 2, pp. 114-116, 2009.
8. B. Arneson, R. B. Hayward, and P. Henderson, "Monte Carlo tree search in hex," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 251-258, Dec. 2010.
9. J. Asmuth and M. L. Littman, "Approaching Bayes-optimalilty using Monte-Carlo tree search," presented at the Monte Carlo Tree Search Workshop, 21st Int. Conf. Autom. Plan. Sched., Freiburg, Germany, 2011 [Online]. Available: Http://icaps11.icaps-conference.org/proceedings/mcts/asmuth-littman. pdf, ISBN: 978-1-57735-504-5 (CD)
10. J. Asmuth and M. L. Littman, "Learning is planning: Near Bayes-optimal reinforcement learning via Monte-Carlo tree search," in Proc. Conf. Uncertainty Artif. Intell., Barcelona, Spain, 2011, pp. 19-26.
11. J.-Y. Audibert and S. Bubeck, "Minimax policies for adversarial and stochastic bandits," in Proc. 22nd Annu. Conf. Learn. Theory, Montreal, QC, Canada, 2009, pp. 773-818.
12. P. Audouard, G. M. J.-B. Chaslot, J.-B. Hoock, J. Perez, A. Rimmel, and O. Teytaud, "Grid coevolution for adaptive simulations; application to the building of opening books in the game of Go," in Proc. Evol. Games, Tübingen, Germany, 2009, pp. 323-332.
13. P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-time analysis of the multiarmed bandit problem," Mach. Learn., vol. 47, no. 2, pp. 235-256, 2002. (Pubitemid 34126111)
14. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire, "Gambling in a rigged casino: The adversarial multi-armed bandit problem," in Proc. Annu. Symp. Found. Comput. Sci.,Milwaukee, WI, 1995, pp. 322-331.
15. A. Auger and O. Teytaud, "Continuous lunches are free plus the design of optimal optimization algorithms," Algorithmica, vol. 57, no. 1, pp. 121-146, 2010.
16. D. Auger, "Multiple tree for partially observable Monte-Carlo tree search," in Proc. Evol. Games, Torino, Italy, 2011, pp. 53-62.
17. H. Baier and P. D. Drake, "The power of forgetting: Improving the lastgood-reply policy in Monte Carlo Go," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 303-309, Dec. 2010.
18. R.-K. Balla and A. Fern, "UCT for tactical assault planning in real-time strategy games," in Proc. 21st Int. Joint Conf. Artif. Intell., Pasadena, CA, 2009, pp. 40-45.
19. V. Berthier, H. Doghmen, and O. Teytaud, "Consistency modifications for automatically tuned Monte-Carlo tree search," in Proc. Learn. Intell. Optim., Venice, Italy, 2010, pp. 111-124.
20. R. Bjarnason, A. Fern, and P. Tadepalli, "Lower bounding Klondike solitaire with Monte-Carlo planning," in Proc. 19th Int. Conf. Autom. Plan. Sched., Thessaloniki, Greece, 2009, pp. 26-33.
21. Y. Björnsson and H. Finnsson, "CadiaPlayer: A simulation-based general game player," IEEE Trans. Comput. Intell. AI Games, vol. 1, no. 1, pp. 4-15, Mar. 2009.
22. Z. Bnaya, A. Felner, S. E. Shimony, D. Fried, and O. Maksin, "Repeated-task Canadian traveler problem," in Proc. Symp. Combin. Search, Barcelona, Spain, 2011, pp. 24-30.
23. J. Borsboom, J.-T. Saito, G. M. J.-B. Chaslot, and J. W. H. M. Uiterwijk, "A comparison of Monte-Carlo methods for phantom Go," in Proc. BeNeLux Conf. Artif. Intell., Utrecht, The Netherlands, 2007, pp. 57-64.
24. A. Bourki, G. M. J.-B. Chaslot, M. Coulm, V. Danjean, H. Doghmen, J.-B. Hoock, T. Hérault, A. Rimmel, F. Teytaud, O. Teytaud, P. Vayssièare, and Z. Yu, "Scalability and parallelization of Monte-Carlo tree search," in Proc. Int. Conf. Comput. Games, Kanazawa, Japan, 2010, pp. 48-58.
25. A. Bourki, M. Coulm, P. Rolet, O. Teytaud, and P. Vayssièare, "Parameter tuning by simple regret algorithms and multiple simultaneous hypothesis testing," in Proc. Int. Conf. Inf. Control Autom. Robot., Funchal, Portugal, 2010, pp. 169-173.
26. B. Bouzy, "Move pruning techniques for Monte-Carlo Go," in Proc. Adv. Comput. Games, Taipei, Taiwan, 2005, pp. 104-119.
27. R. Briesemeister, "Analysis and implementation of the Game OnTop," M.S. thesis, Dept. Knowl. Eng., Maastricht Univ., Maastricht, The Netherlands, 2009.
28. C. Browne, "Automatic generation and evaluation of recombination games," Ph.D. dissertation, Dept. Comput., Queensland Univ. Technol. (QUT), Brisbane, Qld., Australia, 2008.
29. C. Browne, "On the dangers of random playouts," Int. Comput. Games Assoc. J., vol. 34, no. 1, pp. 25-26, 2010.
30. C. Browne, "Towards MCTS for creative domains," in Proc. Int. Conf. Comput. Creat., Mexico City, Mexico, 2011, pp. 96-101.
31. B. Brügmann, "Monte Carlo Go," Max-Planke-Inst. Phys., Munich, Germany, Tech. Rep., 1993.
32. S. Bubeck,R.Munos, andG. Stoltz, "Pure exploration in finitely-armed and continuously-armed bandits," Theor. Comput. Sci., vol. 412, pp. 1832-1852, 2011.
33. S. Bubeck, R. Munos, G. Stoltz, and C. Szepesvári, "Online optimization in x-armed bandits," in Proc. Adv. Neural Inf. Process. Syst., Vancouver, BC, Canada, 2009, vol. 22, pp. 201-208.
34. S. Bubeck, R.Munos, G. Stoltz, and C. Szepesvári, "X-armed bandits," J. Mach. Learn. Res., vol. 12, pp. 1587-1627, 2011.
35. M. Buro, J. R. Long, T. Furtak, and N. R. Sturtevant, "Improving state evaluation, inference, and search in trick-based card games," in Proc. 21st Int. Joint Conf. Artif. Intell., Pasadena, CA, 2009, pp. 1407-1413.
36. T. Cazenave, "A phantom Go program," in Proc. Adv. Comput. Games, Taipei, Taiwan, 2006, pp. 120-125.
37. T. Cazenave, "Evolving Monte-Carlo tree search algorithms," Dept. Inf., Univ. Paris 8, Paris, France, Tech. Rep., 2007.
38. T. Cazenave, "Playing the right Atari," Int. Comput. Games Assoc. J., vol. 30, no. 1, pp. 35-42, 2007.
39. T. Cazenave, "Reflexive Monte-Carlo search," in Proc. Comput. Games Workshop, Amsterdam, The Netherlands, 2007, pp. 165-173.
40. T. Cazenave, "Multi-player Go," in Proc. Comput. Games, Beijing, China, 2008, pp. 50-59.
41. T. Cazenave, "Monte-Carlo Kakuro," in Proc. Adv. Comput. Games, Pamplona, Spain, 2009, pp. 45-54.
42. T. Cazenave, "Nested Monte-Carlo search," in Proc. 21st Int. Joint Conf. Artif. Intell., Pasadena, CA, 2009, pp. 456-461.
43. T. Cazenave, "Nested Monte-Carlo expression discovery," in Proc. Eur. Conf. Artif. Intell., Lisbon, Portugal, 2010, pp. 1057-1058.
44. T. Cazenave, "Monte-Carlo approximation of temperature," Games of No Chance, 2012, to be published.
45. T. Cazenave, F. Balbo, and S. Pinson, "Monte-Carlo bus regulation," in Proc. Int. IEEE Conf. Intell. Trans. Syst., St. Louis, MO, 2009, pp. 340-345.
46. T. Cazenave and J. Borsboom, "Golois wins phantom Go tournament," Int. Comput. Games Assoc. J., vol. 30, no. 3, pp. 165-166, 2007.
47. T. Cazenave and N. Jouandeau, "On the parallelization of UCT," in Proc. Comput. Games Workshop, Amsterdam, The Netherlands, 2007, pp. 93-101.
48. T. Cazenave and N. Jouandeau, "A parallel Monte-Carlo tree search algorithm," in Proc. Comput. Games, Beijing, China, 2008, pp. 72-80.
49. T. Cazenave and N. Jouandeau, "Parallel nested Monte-Carlo search," in Proc. IEEE Int. Parallel Distrib. Processes Symp., Rome, Italy, 2009, DOI: 10.1109/IPDPS.2009.5161122.
50. T. Cazenave and A. Saffidine, "Monte-Carlo Hex," in Proc. Board Games Studies Colloq., Paris, France, 2010.
51. T. Cazenave and A. Saffidine, "Score bounded Monte-Carlo tree search," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 93-104.
52. G. M. J.-B. Chaslot, S. Bakkes, I. Szita, and P. Spronck, "Monte-Carlo tree search: A new framework for game AI," in Proc. Artif. Intell. Interact. Digit. Entertain. Conf., Stanford, CA, 2008, pp. 216-217.
53. G. M. J.-B. Chaslot, L. Chatriot, C. Fiter, S. Gelly, J.-B. Hoock, J. Perez, A. Rimmel, and O. Teytaud, "Combining expert, offline, transient and online knowledge in Monte-Carlo exploration," Lab. Rech. Inf. (LRI), Paris, France, Tech. Rep., 2008.
54. G. M. J.-B. Chaslot, S. de Jong, J.-T. Saito, and J. W. H. M. Uiterwijk, "Monte-Carlo tree search in production management problems," in Proc. BeNeLux Conf. Artif. Intell., Namur, Belgium, 2006, pp. 91-98.
55. G. M. J.-B. Chaslot, C. Fiter, J.-B. Hoock, A. Rimmel, and O. Teytaud, "Adding expert knowledge and exploration in Monte-Carlo tree search," in Proc. Adv. Comput. Games, Pamplona, Spain, 2010, vol. 6048, pp. 1-13.
56. G. M. J.-B. Chaslot, J.-B. Hoock, J. Perez, A. Rimmel, O. Teytaud, and M. H.M.Winands, "MetaMonte-Carlo tree search for automatic opening book generation," in Proc. 21st Int. Joint Conf. Artif. Intell., Pasadena, CA, 2009, pp. 7-12.
57. G. M. J.-B. Chaslot, J.-B. Hoock, F. Teytaud, and O. Teytaud, "On the huge benefit of quasi-random mutations for multimodal optimization with application to grid-based tuning of neurocontrollers," in Proc. Eur. Symp. Artif. Neural Netw., Bruges, Belgium, 2009 [Online]. Available: Http://www.dice.ucl.ac.be/Proceedings/esann/esannpdf/es2009-124.pdf, ISBN: 2-930307-09-9
58. G. M. J.-B. Chaslot, M. H. M. Winands, I. Szita, and H. J. van den Herik, "Cross-entropy for Monte-Carlo tree search," Int. Comput. Games Assoc. J., vol. 31, no. 3, pp. 145-156, 2008.
59. G. M. J.-B. Chaslot, M. H. M. Winands, and H. J. van den Herik, "Parallel Monte-Carlo tree search," in Proc. Comput. Games, Beijing, China, 2008, pp. 60-71.
60. G.M. J.-B. Chaslot, M. H. M. Winands, H. J. van den Herik, J.W. H. M. Uiterwijk, and B. Bouzy, "Progressive strategies for Monte-Carlo tree search," NewMath. Nat. Comput., vol. 4, no. 3, pp. 343-357, 2008.
61. K.-H. Chen, D. Du, and P. Zhang, "Monte-Carlo tree search and computer Go," Adv. Inf. Intell. Syst., vol. 251, pp. 201-225, 2009.
62. J. Chevelu, T. Lavergne, Y. Lepage, and T. Moudenc, "Introduction of a new paraphrase generation tool based on Monte-Carlo sampling," in Proc. 4th Int. Joint Conf. Natural Lang. Process., Singapore, 2009, vol. 2, pp. 249-252.
63. B. E. Childs, J. H. Brodeur, and L. Kocsis, "Transpositions and move groups in Monte Carlo tree search," in Proc. IEEE Symp. Comput. Intell. Games, Perth, Australia, 2008, pp. 389-395.
64. C.-W. Chou, O. Teytaud, and S.-J. Yen, "Revisiting Monte-Carlo tree search on a normal form game: NoGo," in Proc. Appl. Evol. Comput., 2011, pp. 73-82.
65. P.-C. Chou, H. Doghmen, C.-S. Lee, F. Teytaud, O. Teytaud, H.-M. Wang, M.-H. Wang, L.-W. Wu, and S.-J. Yen, "Computational and human intelligence in blind Go," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 235-242.
66. P. Ciancarini and G. P. Favini, "Monte Carlo tree search techniques in the game of Kriegspiel," in Proc. 21st Int. Joint Conf. Artif. Intell., Pasadena, CA, 2009, pp. 474-479.
67. P. Ciancarini and G. P. Favini, "Monte Carlo tree search in Kriegspiel," Artif. Intell., vol. 174, no. 11, pp. 670-684, Jul. 2010.
68. R. Coquelin, Pierre-Arnaud, and Munos, "Bandit algorithms for tree search," in Proc. Conf. Uncertainty Artif. Intell., Vancouver, BC, Canada, 2007, pp. 67-74.
69. A. Couëtoux, J.-B. Hoock, N. Sokolovska, O. Teytaud, and N. Bonnard, "Continuous upper confidence trees," in Proc. Learn. Intell. Optim., Rome, Italy, 2011, pp. 433-445.
70. R. Coulom, "Efficient selectivity and backup operators inMonte-Carlo tree search," in Proc. 5th Int. Conf. Comput. Games, Turin, Italy, 2006, pp. 72-83.
71. R. Coulom, "Computing Elo ratings of move patterns in the game of Go," Int. Comput. Games Assoc. J., vol. 30, no. 4, pp. 198-208, 2007.
72. R. Coulom, "Monte-Carlo tree search in crazy stone," in Proc. Game Prog. Workshop, Tokyo, Japan, 2007, pp. 74-75.
73. F. de Mesmay, A. Rimmel, Y. Voronenko, and M. Püschel, "Banditbased optimization on graphs with application to library performance tuning," in Proc. 26th Annu. Int. Conf. Mach. Learn., Montreal, QC, Canada, 2009, pp. 729-736.
74. N. G. P. Den Teuling, "Monte-Carlo tree search for the simultaneous move game Tron," Univ. Maastricht, Maastricht, The Netherlands, Tech. Rep., 2011.
75. P. D. Drake, "The last-good-reply policy for Monte-Carlo Go," Int. Comput. Games Assoc. J., vol. 32, no. 4, pp. 221-227, 2009.
76. P. D. Drake and S. Uurtamo, "Heuristics in Monte Carlo Go," in Proc. Int. Conf. Artif. Intell., Las Vegas, NV, 2007, pp. 171-175.
77. P. D. Drake and S. Uurtamo, "Move ordering vs heavy playouts:Where should heuristics be applied in Monte Carlo Go," in Proc. 3rd North Amer. Game-On Conf., Gainesville, FL, 2007, pp. 35-42.
78. S. Edelkamp, P. Kissmann, D. Sulewski, and H. Messerschmidt, "Finding the needle in the haystack with heuristically guided swarm tree search," in Proc. Multikonf. Wirtschaftsinf., Gottingen, Germany, 2010, pp. 2295-2308.
79. M. Enzenberger and M. Müller, "Fuego-An open-source framework for board games and Go engine based on Monte-Carlo tree search," Univ. Alberta, Edmonton, AB, Canada, Tech. Rep., Apr. 2009.
80. M. Enzenberger and M. Müller, "A lock-free multithreaded Monte-Carlo tree search algorithm," in Proc. Adv. Comput. Games, Pamplona, Spain, 2010, vol. 6048, pp. 14-20.
81. M. Enzenberger, M. Müller, B. Arneson, and R. B. Segal, "Fuego-An open-source framework for board games and Go engine based on Monte Carlo tree search," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 259-270, Dec. 2010.
82. A. Fern and P. Lewis, "Ensemble Monte-Carlo planning: An empirical study," in Proc. 21st Int. Conf. Autom. Plan. Sched., Freiburg, Germany, 2011, pp. 58-65.
83. H. Finnsson, "CADIA-Player: A general game playing agent," M.S. thesis, Schl. Comput. Sci., Reykjavik Univ., Reykjavik, Iceland, Mar. 2007.
84. H. Finnsson and Y. Björnsson, "Simulation-based approach to general game playing," in Proc. Assoc. Adv. Artif. Intell., Chicago, IL, 2008, pp. 259-264.
85. H. Finnsson and Y. Björnsson, "Simulation control in general game playing agents," in Proc. Int. Joint Conf. Artif. Intell. Workshop Gen. Game Playing, Pasadena, CA, 2009, pp. 21-26.
86. H. Finnsson and Y. Björnsson, "Learning simulation control in general game-playing agents," in Proc. 24th AAAI Conf. Artif. Intell., Atlanta, GA, 2010, pp. 954-959.
87. H. Finnsson and Y. Björnsson, "CadiaPlayer: Search-control techniques," Künstliche Intelligenz, vol. 25, no. 1, pp. 9-16, Jan. 2011.
88. Y. Fu, S. Yang, S. He, J. Yang, X. Liu, Y. Chen, and D. Ji, "To create intelligent adaptive neuro-controller of game opponent from UCT-created data," in Proc. Fuzzy Syst. Knowl. Disc., Tianjin, China, 2009, pp. 445-449.
89. R. Gaudel and M. Sebag, "Feature selection as a one-player game," in Proc. 27th Int. Conf. Mach. Learn., Haifa, Israel, 2010, pp. 359-366.
90. S. Gelly, "A contribution to reinforcement learning; Application to computer-Go," Ph.D. dissertation, Informatique, Univ. Paris-Sud, Paris, France, 2007.
91. S. Gelly, J.-B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, "The parallelization of Monte-Carlo planning," in Proc. 5th Int. Conf. Inf. Control Autom. Robot., Funchal, Portugal, 2008, pp. 244-249.
92. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in Proc. 24th Annu. Int. Conf. Mach. Learn., Corvalis, OR, 2007, pp. 273-280.
93. S. Gelly and D. Silver, "Achieving master level play in 9 9 computer Go," in Proc. Assoc. Adv. Artif. Intell., Chicago, IL, 2008, vol. 1, pp. 1537-1540.
94. S. Gelly and D. Silver, "Monte-Carlo tree search and rapid action value estimation in computer Go," Artif. Intell., vol. 175, no. 11, pp. 1856-1875, Jul. 2011.
95. S. Gelly and Y. Wang, "Exploration exploitation in Go: UCT for Monte-Carlo Go," in Proc. Adv. Neural Inf. Process. Syst., Vancouver, BC, Canada, 2006 [Online]. Available: Http://www.stat.lsa.umich.edu/~yizwang/ publications/gelly06exploration.pdf, ISBN: 0262195682
96. S. Gelly, Y. Wang, R. Munos, and O. Teytaud, "Modification of UCT with patterns in Monte-Carlo Go," Inst. Nat. Rech. Inf. Autom. (INRIA), Paris, France, Tech. Rep., 2006.
97. M. L. Ginsberg, "GIB: Imperfect information in a computationally challenging game," J. Artif. Intell. Res., vol. 14, pp. 303-358, 2001.
98. T. Graf, U. Lorenz, M. Platzner, and L. Schaefers, "Parallel Monte-Carlo tree search for HPC systems," in Proc. 17th Int. Eur. Conf. Parallel Distrib. Comput., Bordeaux, France, 2011, pp. 365-376.
99. S. He, Y.Wang, F. Xie, J. Meng, H. Chen, S. Luo, Z. Liu, and Q. Zhu, "Game player strategy pattern recognition and how UCT algorithms apply pre-knowledge of player's strategy to improve opponent AI," in Proc. Int. Conf. Comput. Intell. Model. Control Autom., Vienna, Austria, Dec. 2008, pp. 1177-1181.
100. S. He, F. Xie, Y. Wang, S. Luo, Y. Fu, J. Yang, Z. Liu, and Q. Zhu, "To create adaptive game opponent by using UCT," in Proc. Int. Conf. Comput. Intell. Model. Control Autom., Vienna, Austria, Dec. 2008, pp. 67-70.
101. D. P. Helmbold and A. Parker-Wood, "All-moves-as-first heuristics in Monte-Carlo Go," in Proc. Int. Conf. Artif. Intell., Las Vegas, NV, 2009, pp. 605-610.
102. B. Helmstetter, C.-S. Lee, F. Teytaud, O. Teytaud, M.-H. Wang, and S.-J. Yen, "Random positions in Go," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 250-257.
103. P. Hingston and M. Masek, "Experiments with Monte Carlo Othello," in Proc. IEEE Congr. Evol. Comput., Singapore, 2007, pp. 4059-4064. (Pubitemid 351371926)
104. J.-B. Hoock, C.-S. Lee,A.Rimmel, F. Teytaud, O. Teytaud, andM.-H. Wang, "Intelligent agents for the game of Go," IEEE Comput. Intell. Mag., vol. 5, no. 4, pp. 28-42, Nov. 2010.
105. J.-B. Hoock and O. Teytaud, "Bandit-based genetic programming," in Proc. Eur. Conf. Gen. Progr., Istanbul, Turkey, 2010, vol. 6021, pp. 268-277.
106. J. Huang, Z. Liu, B. Lu, and F. Xiao, "Pruning in UCT algorithm," in Proc. Int. Conf. Tech. Appl. Artif. Intell., Hsinchu, Taiwan, 2010, pp. 177-181.
107. S.-C. Huang, "New heuristics for Monte Carlo tree search applied to the Game of Go," Ph.D. dissertation, Dept. Comput. Sci., Nat. Taiwan Normal Univ., Taipei, Taiwan, 2011.
108. S.-C. Huang, R. Coulom, and S.-S. Lin, "Monte-Carlo simulation balancing applied to 9 9 Go," Int. Comput. Games Assoc. J., vol. 33, no. 4, pp. 191-201, 2010.
109. S.-C. Huang, R. Coulom, and S.-S. Lin, "Monte-Carlo simulation balancing in practice," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 81-92.
110. S.-C. Huang, R. Coulom, and S.-S. Lin, "Time management for Monte-Carlo tree search applied to the game of Go," in Proc. Int. Conf. Technol. Appl. Artif. Intell., Hsinchu City, Taiwan, 2010, pp. 462-466.
111. N. Ikehata and T. Ito, "Monte Carlo tree search in Ms. Pac-Man," in Proc. 15th Game Progr. Workshop, Kanagawa, Japan, 2010, pp. 1-8.
112. N. Ikehata and T. Ito, "Monte-Carlo tree search in Ms. Pac-Man," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 39-46.
113. H. Kato and I. Takeuchi, "Parallel Monte-Carlo tree search with simulation servers," in Proc. Int. Conf. Technol. Appl. Artif. Intell., Hsinchu City, Taiwan, 2010, pp. 491-498.
114. J. Kloetzer, "Experiments in Monte-Carlo amazons," J. Inf. Process. Soc. Jpn., vol. 2010-GI-24, no. 6, pp. 1-4, 2010.
115. J. Kloetzer, "Monte-Carlo opening books for amazons," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 124-135.
116. J. Kloetzer, H. Iida, and B. Bouzy, "TheMonte-Carlo approach in amazons," in Proc. Comput. Games Workshop, Amsterdam, The Netherlands, 2007, pp. 113-124.
117. J. Kloetzer, H. Iida, and B. Bouzy, "A comparative study of solvers in amazons endgames," in Proc. IEEE Conf. Comput. Intell. Games, Perth, Australia, 2008, pp. 378-384.
118. J. Kloetzer, H. Iida, and B. Bouzy, "Playing amazons endgames," Int. Comput. Games Assoc. J., vol. 32, no. 3, pp. 140-148, 2009.
119. L. Kocsis and C. Szepesvári, "Bandit based Monte-Carlo planning," in Proc. Eur. Conf. Mach. Learn., Berlin, Germany, 2006, pp. 282-293. (Pubitemid 44618839)
120. L. Kocsis, C. Szepesvári, and J. Willemson, "Improved Monte-Carlo search," Univ. Tartu, Tartu, Estonia, Tech. Rep. 1, 2006.
121. S. Könnecke and J. Waldmann, "Efficient playouts for the Havannah abstract board game," Hochschule Technik, Leipzig, Germany, Tech. Rep., 2009.
122. T. Kozelek, "Methods of MCTS and the game Arimaa," M.S. thesis, Dept. Theor. Comput. Sci. Math. Logic, Charles Univ., Prague, Czech Republic, 2009.
123. K. L. Kroeker, "A new benchmark for artificial intelligence," Commun. ACM, vol. 54, no. 8, pp. 13-15, Aug. 2011.
124. T. L. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules," Adv. Appl. Math., vol. 6, pp. 4-22, 1985.
125. M. Lanctot, K. Waugh, M. Zinkevich, and M. Bowling, "Monte Carlo sampling for regret minimization in extensive games," in Proc. Adv. Neural Inf. Process. Syst., Vancouver, BC, Canada, 2009, pp. 1078-1086.
126. S. M. LaValle, "Rapidly-exploring random trees: A new tool for path planning," Comput. Sci. Dept., Iowa State Univ., Ames, IA, TR 98-11, Tech. Rep., 1998.
127. C.-S. Lee, M. Müller, and O. Teytaud, "Guest editorial: Special issue on Monte Carlo techniques and computer Go," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 225-228, Dec. 2010.
128. C.-S. Lee, M.-H. Wang, G. M. J.-B. Chaslot, J.-B. Hoock, A. Rimmel, O. Teytaud, S.-R. Tsai, S.-C. Hsu, and T.-P. Hong, "The computational intelligence of MoGo revealed in Taiwan's computer Go tournaments," IEEE Trans. Comput. Intell. AI Games, vol. 1, no. 1, pp. 73-89, Mar. 2009.
129. C.-S. Lee,M.-H. Wang, T.-P. Hong, G. M. J.-B. Chaslot, J.-B. Hoock, A. Rimmel, O. Teytaud, and Y.-H. Kuo, "A novel ontology for computer Go knowledge management," in Proc. IEEE Int. Conf. Fuzzy Syst., Jeju Island, Korea, Aug. 2009, pp. 1056-1061.
130. J. R. Long, N. R. Sturtevant, M. Buro, and T. Furtak, "Understanding the success of perfect information Monte Carlo sampling in game tree search," in Proc. Assoc. Adv. Artif. Intell., Atlanta, GA, 2010, pp. 134-140.
131. S. Lopez, "Rybka's Monte Carlo analysis," 2008 [Online]. Available: Http://www.chessbase.com/newsdetail.asp?newsid= 5075
132. R. J. Lorentz, "Amazons discover Monte-Carlo," in Proc. Comput. Games, Beijing, China, 2008, pp. 13-24.
133. R. J. Lorentz, "Improving Monte-Carlo tree search in Havannah," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 105-115.
134. R. J. Lorentz, "Castro wins Havannah tournament," Int. Comput. Games Assoc. J., vol. 33, no. 4, p. 232, 2011.
135. T.Mahlmann, J. Togelius, and G. N. Yannakakis, "Modelling and evaluation of complex scenarios with the strategy game description language," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 174-181.
136. T. Mahlmann, J. Togelius, and G. N. Yannakakis, "Towards procedural strategy game generation: Evolving complementary unit types," in Proc. Appl. Evol. Comput., Torino, Italy, 2011, pp. 93-102.
137. R. Maitrepierre, J. Mary, and R. Munos, "Adaptive play in texas Hold'em Poker," in Proc. Eur. Conf. Artif. Intell., Patras, Greece, 2008, pp. 458-462.
138. C. Mansley, A. Weinstein, and M. L. Littman, "Sample-based planning for continuous action Markov decision processes," in Proc. 21st Int. Conf. Autom. Plan. Sched., Freiburg, Germany, 2011, pp. 335-338.
139. L. S. Marcolino and H. Matsubara, "Multi-agent Monte Carlo Go," in Proc. Int. Conf. Autonom. AgentsMulti-Syst., Taipei, Taiwan, 2011, pp. 21-28.
140. S. Matsumoto, N. Hirosue, K. Itonaga, K. Yokoo, and H. Futahashi, "Evaluation of simulation strategy on single-player Monte-Carlo tree search and its discussion for a practical scheduling problem," in Proc. Int. Multi Conf. Eng. Comput. Scientists, Hong Kong, 2010, vol. 3, pp. 2086-2091.
141. R. E. McInerney, "Multi-armed bandit Bayesian decision making," Univ. Oxford, Oxford, U.K., Tech. Rep., 2010.
142. J. Méhat and T. Cazenave, "Ary: A program for general game playing," Dept. Inf., Univ. Paris 8, Paris, France, Tech. Rep., 2008.
143. J. Méhat and T. Cazenave, "Monte-Carlo tree search for general game playing," Univ. Paris 8, Dept. Inf., Tech. Rep., 2008.
144. J. Méhat and T. Cazenave, "Combining UCT and nested Monte Carlo search for single-player general game playing," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 271-277, Dec. 2010.
145. J. Méhat and T. Cazenave, "A parallel general game player," Künstliche Intelligenz, vol. 25, no. 1, pp. 43-47, 2011.
146. J.Méhat and T. Cazenave, "Tree parallelization of Ary on a cluster," in Proc. Int. Joint Conf. Artif. Intell., Barcelona, Spain, 2011, pp. 39-43.
147. M.Möller,M. Schneider,M.Wegner, and T. Schaub, "Centurio, a general game player: Parallel, java-and ASP-based," Künstliche Intelligenz, vol. 25, no. 1, pp. 17-24, Dec. 2010.
148. M. Müller, "Fuego-GB prototype at the Human Machine Competition in Barcelona 2010: A Tournament Report and Analysis," Univ. Alberta, Edmonton, AB, Canada, Tech. Rep., 2010.
149. H. Nakhost andM.Müller, "Monte-Carlo exploration for deterministic planning," in Proc. 21st Int. Joint Conf. Artif. Intell., Pasadena, CA, 2009, pp. 1766-1771.
150. M. Naveed, D. E. Kitchin, and A. Crampton, "Monte-Carlo planning for pathfinding in real-time strategy games," in Proc. 28th Workshop U.K. Spec. Int. Group Plan. Sched., Brescia, Italy, 2010, pp. 125-132.
151. K. Q. Nguyen, T.Miyama, A. Yamada, T. Ashida, and R. Thawonmas, "ICE gUCT," Int. Comput. Entertain. Lab., Ritsumeikan Univ., Kyoto, Japan, Tech. Rep., 2011.
152. J. P. A. M. Nijssen, "Playing Othello using Monte Carlo," Strategies, pp. 1-9, 2007.
153. J. P. A. M. Nijssen, "Using intelligent search techniques to play the game Khet," M.S. thesis, Dept. Knowl. Eng., Maastricht Univ., Maastricht, The Netherlands, 2009.
154. J. P. A. M. Nijssen and J.W. H.M. Uiterwijk, "Using intelligent search techniques to play the game Khet," Dept. Knowl. Eng., Maastricht Univ., Maastricht, The Netherlands, Tech. Rep., 2009.
155. J. P. A. M. Nijssen and M. H. M. Winands, "Enhancements for multiplayer Monte-Carlo tree search," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 238-249.
156. J. P. A. M. Nijssen and M. H. M. Winands, "Monte-Carlo tree search for the game of Scotland yard," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 158-165.
157. Y. Osaki, K. Shibahara, Y. Tajima, and Y. Kotani, "An Othello evaluation function based on temporal difference learning using probability of winning," in Proc. IEEE Conf. Comput. Intell. Games, Perth, Australia, Dec. 2008, pp. 205-211.
158. D. Pellier, B. Bouzy, and M. Métivier, "An UCT approach for anytime agent-based planning," in Proc. Int. Conf. Pract. Appl. Agents Multi. Syst., Salamanca, Spain, 2010, pp. 211-220.
159. M. Ponsen, G. Gerritsen, and G. M. J.-B. Chaslot, "Integrating opponent models with Monte-Carlo tree search in poker," in Proc. Conf. Assoc. Adv. Artif. Intell., Inter. Decision Theory Game Theory Workshop, Atlanta, GA, 2010, pp. 37-42.
160. A. Previti, R. Ramanujan, M. Schaerf, and B. Selman, "Monte-Carlo style UCT search for boolean satisfiability," in Proc. 12th Int. Conf. Ital. Assoc. Artif. Intell., Palermo, Italy, 2011, pp. 177-188.
161. T. Raiko and J. Peltonen, "Application of UCT search to the connection games of hex, Y, Star, and Renkula!," in Proc. Finn. Artif. Intell. Conf., Espoo, Finland, 2008, pp. 89-93.
162. R. Ramanujan, A. Sabharwal, and B. Selman, "On adversarial search spaces and sampling-based planning," in Proc. 20th Int. Conf. Autom. Plan. Sched., Toronto, ON, Canada, 2010, pp. 242-245.
163. R. Ramanujan, A. Sabharwal, and B. Selman, "Understanding sampling style adversarial search methods," in Proc. Conf. Uncertainty Artif. Intell., Catalina Island, CA, 2010, pp. 474-483.
164. R. Ramanujan, A. Sabharwal, and B. Selman, "On the behavior of UCT in synthetic search spaces," presented at the Monte Carlo Tree Search Workshop, 21st Int. Conf. Autom. Plan. Sched., Freiburg, Germany, 2011 [Online]. Available: Http://www.cs.cornell. edu/~raghu/Raghuram-Ramanujan-files/mcts11. pdf, ISBN: 978-1-57735-504-5 (CD)
165. R. Ramanujan and B. Selman, "Trade-offs in sampling-based adversarial planning," in Proc. 21st Int. Conf. Autom. Plan. Sched., Freiburg, Germany, 2011, pp. 202-209.
166. A. Rimmel, "Improvements and evaluation of the Monte-Carlo tree search algorithm," Ph.D. dissertation, Dept. Comput. Sci. Inf. Eng., Lab. Rech. Inf. (LRI), Paris, France, 2009.
167. A. Rimmel and F. Teytaud, "Multiple overlapping tiles for contextual Monte Carlo tree search," in Proc. Appl. Evol. Comput. 1, Torino, Italy, 2010, pp. 201-210.
168. A. Rimmel, F. Teytaud, and T. Cazenave, "Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows," in Proc. Appl. Evol. Comput. 2, Torino, Italy, 2011, pp. 501-510.
169. A. Rimmel, F. Teytaud, and O. Teytaud, "Biasing Monte-Carlo simulations through RAVE values," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 59-68.
170. A. Rimmel, O. Teytaud, C.-S. Lee, S.-J. Yen, M.-H. Wang, and S.-R. Tsai, "Current frontiers in computer Go," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 229-238, Dec. 2010.
171. D. Robles and S. M. Lucas, "A simple tree search method for playing Ms. Pac-Man," in Proc. IEEE Conf. Comput. Intell. Games, Milan, Italy, 2009, pp. 249-255.
172. D. Robles, P. Rohlfshagen, and S. M. Lucas, "Learning non-random moves for playing Othello: Improving Monte Carlo tree search," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 305-312.
173. P. Rolet, M. Sebag, and O. Teytaud, "Boosting active learning to optimality: A tractable Monte-Carlo, Billiard-based algorithm," in Proc. Euro. Conf. Mach. Learn. Knowl. Disc. Database, Bled, Slovenia, 2009, pp. 302-317.
174. P. Rolet, M. Sebag, and O. Teytaud, "Optimal robust expensive optimization is tractable," in Proc. 11th Annu. Conf. Genet. Evol. Comput., Montreal, QC, Canada, 2009, pp. 1951-1956.
175. P. Rolet, M. Sebag, and O. Teytaud, "Upper confidence trees and billiards for optimal active learning," in Proc. Conf. l'Apprentissage Autom., Hammamet, Tunisia, 2009 [Online]. Available: URL: Http://hal.inria.fr/ docs/00/36/97/87/PDF/capfinal.pdf
176. C. D. Rosin, "Nested rollout policy adaptation for Monte Carlo tree search," in Proc. 22nd Int. Joint Conf. Artif. Intell., Barcelona, Spain, 2011, pp. 649-654.
177. J. Rubin and I.Watson, "Computer poker: A review," Artif. Intell., vol. 175, no. 5-6, pp. 958-987, Apr. 2011.
178. S. J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 2009.
179. A. Sabharwal and H. Samulowitz, "Guiding combinatorial optimization with UCT," presented at the Monte Carlo Tree Search Workshop, 21st Int. Conf. Autom. Plan. Sched., Freiburg, Germany, 2011 [Online]. Available: Http://www.cs.toronto.edu/~horst/cogrobo/papers/uctmip.pdf, ISBN: 978-1-57735-504-5 (CD)
180. A. Saffidine, "Utilisation dUCT au Hex," Ecole Normale Super., Lyon, France, Tech. Rep., 2008.
181. A. Saffidine, "Some improvements for Monte-Carlo tree search, game description language compilation, score bounds and transpositions," M.S. thesis, Paris-Dauphine Lamsade, Paris, France, 2010.
182. A. Saffidine and T. Cazenave, "UCD: Upper confidence bound for rooted directed acyclic graphs," in Proc. Conf. Technol. Appl. Artif. Intell., Hsinchu City, Taiwan, 2010, pp. 467-473.
183. J.-T. Saito, G. M. J.-B. Chaslot, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Monte-Carlo proof-number search for computer Go," in Proc. 5th Int. Conf. Comput. Games, Turin, Italy, 2006, pp. 50-61.
184. S. Samothrakis, D. Robles, and S. M. Lucas, "A UCT agent for Tron: Initial investigations," in Proc. IEEE Symp. Comput. Intell. Games, Dublin, Ireland, 2010, pp. 365-371.
185. S. Samothrakis, D. Robles, and S. M. Lucas, "Fast approximate max-n Monte-Carlo tree search forMs Pac-Man," IEEE Trans. Comput. Intell. AI Games, vol. 3, no. 2, pp. 142-154, Jun. 2011.
186. Y. Sato, D. Takahashi, and R. Grimbergen, "A Shogi program based on Monte-Carlo tree search," Int. Comput. Games Assoc. J., vol. 33, no. 2, pp. 80-92, 2010.
187. B. Satomi, Y. Joe, A. Iwasaki, and M. Yokoo, "Real-time solving of quantified CSPs based on Monte-Carlo game tree search," in Proc. 22nd Int. Joint Conf. Artif. Intell., Barcelona, Spain, 2011, pp. 655-662.
188. F. C. Schadd, "Monte-Carlo search techniques in the modern board game Thurn and Taxis," M.S. thesis, Dept. Knowl. Eng., Maastricht Univ.,
189. M. P. D. Schadd, "Selective search in games of different complexity," Ph.D. dissertation, Dept. Knowl. Eng., Maastricht Univ., Maastricht, The Netherlands, 2011.
190. M. P. D. Schadd, M. H. M. Winands, H. J. van den Herik, and H. Aldewereld, "Addressing NP-complete puzzles with Monte-Carlo methods," in Proc. Artif. Intell. Simul. Behav. Symp. Logic Simul. Interact. Reason., Aberdeen, U.K., 2008, pp. 55-61.
191. M. P. D. Schadd, M. H. M. Winands, H. J. van den Herik, G. M. J.-B. Chaslot, and J. W. H. M. Uiterwijk, "Single-player Monte-Carlo tree search," in Proc. Comput. Games, Beijing, China, 2008, pp. 1-12.
192. L.Schaefers,M.Platzner,andU.Lorenz,"UCT-treesplit-parallelMCTS ondistributedmemory,"presented attheMonteCarloTreeSearchWorkshop, 21st Int.Conf.Autom. Plan.Sched., Freiburg,Germany,2011[Online]. Available: Http://icaps11.icaps-conference.org/proceedings/mcts/schaefers-et-al.pdf, ISBN: 978-1-57735-504-5 (CD)
193. J. Schaeffer, "The history heuristic and alpha-beta search enhancements in practice," IEEE Trans. Pattern Anal. Mach. Intell., vol. 11, no. 11, pp. 1203-1212, Nov. 1989. (Pubitemid 20630610)
194. J. Schäfer, "The UCT algorithm applied to games with imperfect information," Diploma thesis, Fakultat Informatik, Otto-Von-Guericke Univ., Magdeburg, Germany, 2008.
195. R. B. Segal, "On the scalability of parallel UCT," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 36-47.
196. M. Shafiei, N. R. Sturtevant, and J. Schaeffer, "Comparing UCT versus CFR in simultaneous games," in Proc. Int. Joint Conf. Artif. Intell. Workshop Gen. Game Playing, Pasadena, CA, 2009 [Online]. Available: Http://webdocs.cs.ualberta.ca/~nathanst/papers/uctcfr.pdf
197. S. Sharma, Z. Kobti, and S. Goodwin, "Knowledge generation for improving simulations in UCT for general game playing," in Proc. Adv. Artif. Intell., Auckland, New Zealand, 2008, pp. 49-55.
198. S. Sharma, Z. Kobti, and S. Goodwin, "Learning and knowledge generation in general games," in Proc. IEEE Symp. Comput. Intell. Games, Perth, Australia, Dec. 2008, pp. 329-335.
199. B. Sheppard, "World-championship-caliber scrabble," Artif. Intell., vol. 134, pp. 241-275, 2002. (Pubitemid 34086585)
200. K. Shibahara and Y. Kotani, "Combining final score with winning percentage by sigmoid function in Monte-Carlo simulations," in Proc. IEEE Conf. Comput. Intell. Games, Perth, Australia, Dec. 2008, pp. 183-190.
201. D. Silver, "Reinforcement learning and simulation-based search in computer Go," Ph.D. dissertation, Dept. Comput. Sci., Univ. Alberta, Edmonton, AB, Canada, 2009.
202. D. Silver, R. S. Sutton, and M. Müller, "Sample-based learning and search with permanent and transient memories," in Proc. 25th Annu. Int. Conf. Mach. Learn., Helsinki, Finland, 2008, pp. 968-975.
203. D. Silver and G. Tesauro, "Monte-Carlo simulation balancing," in Proc. 26th Annu. Int. Conf. Mach. Learn., Montreal, QC, Canada, 2009, pp. 945-952.
204. D. Silver and J. Veness, "Monte-Carlo planning in large POMDPs," in Proc. Neural Inf. Process. Syst., Vancouver, BC, Canada, 2010, pp. 1-9.
205. Y. Soejima, A. Kishimoto, and O. Watanabe, "Evaluating root parallelization in Go," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 278-287, Dec. 2010.
206. J. A. Stankiewicz, "Knowledge-based Monte-Carlo tree search in Havannah," M.S. thesis,Dept.Knowl. Eng.,MaastrichtUniv., Maastricht, The Netherlands, 2011.
207. N. R. Sturtevant, "An analysis of UCT in multi-player games," in Proc. Comput. Games, Beijing, China, 2008, pp. 37-49.
208. N. Sylvester, B. Lohre, S. Dodson, and P. D. Drake, "A linear classifier outperforms UCT in 9 9 Go," in Proc. Int. Conf. Artif. Intell., Las Vegas, NV, 2011, pp. 804-808.
209. I. Szita, G. M. J.-B.Chaslot, and P. Spronck, "Monte-Carlo tree search in settlers of Catan," in Proc. Adv. Comput. Games, Pamplona, Spain, 2010, pp. 21-32.
210. S. Takeuchi, T. Kaneko, and K. Yamaguchi, "Evaluation of Monte Carlo tree search and the application to Go," in Proc. IEEE Conf. Comput. Intell. Games, Perth, Australia, Dec. 2008, pp. 191-198.
211. S. Takeuchi, T. Kaneko, and K. Yamaguchi, "Evaluation of game tree search methods by game records," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 288-302, Dec. 2010.
212. Y. Tanabe, K. Yoshizoe, and H. Imai, "A study on security evaluation methodology for image-based biometrics authentication systems," in Proc. IEEE Conf. Biomed., Theory Appl. Syst.,Washington, DC, 2009, DOI: 10.1109/BTAS.2009.5339016.
213. G. Tesauro, V. T. Rajan, and R. B. Segal, "Bayesian inference in Monte-Carlo tree search," in Proc. Conf. Uncertainty Artif. Intell., Catalina Island, CA, 2010, pp. 580-588.
214. F. Teytaud and O. Teytaud, "Creating an upper-confidence-tree program for Havannah," in Proc. Adv. Comput. Games, Pamplona, Spain, 2010, pp. 65-74.
215. F. Teytaud and O. Teytaud, "On the huge benefit of decisive moves in Monte-Carlo tree search algorithms," in Proc. IEEE Symp. Comput. Intell. Games, Dublin, Ireland, 2010, no. 1, pp. 359-364.
216. F. Teytaud and O. Teytaud, "Lemmas on partial observation, with application to phantom games," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 243-249.
217. O. Teytaud and S. Flory, "Upper confidence trees with short term partial information," in Proc. Appl. Evol. Comput. 1, Torino, Italy, 2011, pp. 153-162.
218. D. Tom, "Investigating UCT and RAVE: Steps towards a more robust method," M.S. thesis, Dept. Comput. Sci., Univ. Alberta, Edmonton, AB, Canada, 2010.
219. D. Tom and M. Müller, "A study of UCT and its enhancements in an artificial game," in Proc. Adv. Comput. Games, Pamplona, Spain, 2010, pp. 55-64.
220. D. Tom and M. Müller, "Computational experiments with the RAVE heuristic," in Proc. Comput. Games, Kanazawa, Japan, 2010, pp. 69-80.
221. B. K.-B. Tong, C. M. Ma, and C. W. Sung, "A Monte-Carlo approach for the endgame ofMs. Pac-Man," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 9-15.
222. B. K.-B. Tong and C. W. Sung, "A Monte-Carlo approach for ghost avoidance in the Ms. Pac-Man game," in Proc. IEEE Consum. Electron. Soc. Games Innov. Conf., Hong Kong, 2011, DOI: 10.1109/ICEGIC.2010.5716879.
223. G. van den Broeck, K. Driessens, and J. Ramon, "Monte-Carlo tree search in Poker using expected reward distributions," Adv. Mach. Learn., no. 1, pp. 367-381, 2009.
224. H. J. van den Herik, "The Drosophila revisited," Int. Comput. Games Assoc. J., vol. 33, no. 2, pp. 65-66, 2010.
225. F. vanLishout, G.M. J.-B.Chaslot, and J.W.H.M. Uiterwijk, "Monte-Carlo tree search in Backgammon," in Proc. Comput. Games Workshop, Amsterdam, The Netherlands, 2007, pp. 175-184.
226. J. Veness, K. S. Ng, M. Hutter, W. Uther, and D. Silver, "A Monte-Carlo AIXI approximation," J. Artif. Intell. Res., vol. 40, pp. 95-142, 2011.
227. T. J.Walsh, S. Goschin, and M. L. Littman, "Integrating sample-based planning and model-based reinforcement learning," in Proc. Assoc. Adv. Artif. Intell., Atlanta, GA, 2010, pp. 612-617.
228. Y. Wang and S. Gelly, "Modifications of UCT and sequence-like simulations for Monte-Carlo Go," in Proc. IEEE Symp. Comput. Intell. Games, Honolulu, HI, 2007, pp. 175-182. (Pubitemid 47431300)
229. C. D.Ward and P. I. Cowling, "Monte Carlo search applied to card selection in magic: The gathering," in Proc. IEEE Symp. Comput. Intell. Games, Milan, Italy, 2009, pp. 9-16.
230. D. Whitehouse, E. J. Powley, and P. I. Cowling, "Determinization and information set Monte Carlo tree search for the card game Dou Di Zhu," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 87-94.
231. G. M. J.Williams, "Determining game quality through UCT tree shape analysis," M.S. thesis,Dept. Comput., Imperial College, London, U.K., 2010.
232. M. H. M. Winands and Y. Björnsson, "Evaluation function based Monte-Carlo LOA," in Proc. Adv. Comput. Games, Pamplona, Spain, 2010, pp. 33-44.
233. M. H. M. Winands and Y. Björnsson, " -based play-outs in Monte-Carlo tree search," in Proc. IEEE Conf. Comput. Intell. Games, Seoul, Korea, 2011, pp. 110-117.
234. M. H. M. Winands, Y. Björnsson, and J.-T. Saito, "Monte-Carlo tree search solver," in Proc. Comput. Games, Beijing, China, 2008, pp. 25-36.
235. M. H. M. Winands, Y. Björnsson, and J.-T. Saito, "Monte-Carlo tree search in lines of action," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 239-250, Dec. 2010.
236. M. H. M. Winands, Y. Björnsson, and J.-T. Saito, "Monte Carlo tree search in lines of action," IEEE Trans. Comput. Intell. AI Games, vol. 2, no. 4, pp. 239-250, Dec. 2010.
237. F. Xie and Z. Liu, "Backpropagation modification in Monte-Carlo game tree search," in Proc. Int. Symp. Intell. Inf. Technol. Appl., NanChang, China, 2009, pp. 125-128.
238. F. Xie, H. Nakhost, and M. Müller, "A local Monte Carlo tree search approach in deterministic planning," in Proc. Assoc. Adv. Artif. Intell., San Francisco, CA, 2011, pp. 1832-1833.
239. J. Yang, Y. Gao, S. He, X. Liu, Y. Fu, Y. Chen, and D. Ji, "To create intelligent adaptive game opponent by using Monte-Carlo for tree search," in Proc. 5th Int. Conf. Natural Comput., Tianjian, China, 2009, pp. 603-607.
240. Y. Zhang, S. He, J. Wang, Y. Gao, J. Yang, X. Yu, and L. Sha, "Optimizing player's satisfaction through DDA of game AI by UCT for the game dead-end," in Proc. 6th Int. Conf. Natural Comput., Yantai, China, 2010, pp. 4161-4165.