Utilisation de la recherche arborescente Monte-Carlo au Hex

Revue d'Intelligence Artificielle

Volumn 23, Issue 2-3, 2009, Pages 183-202

  Cazenave, Tristan ^a   Saffidine, Abdallah ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 8   (France)

Author keywords

AMAF; Hex; Monte Carlo tree search; Parallelization; RAVE

Indexed keywords

ARTIFICIAL INTELLIGENCE;

AMAF; MONTE-CARLO TREE SEARCHES; PARALLELIZATIONS; RAVE; TREE SEARCH;

MONTE CARLO METHODS;

EID: 77954380642     PISSN: 0992499X     EISSN: None     Source Type: Journal    
DOI: 10.3166/RIA.23.183-202     Document Type: Article

References (23)

1. Anshelevich V., « A hierarchical approach to computer Hex », Artificial Intelligence, vol. 134, no 1-2, p. 101-120, 2002.
2. Bjornsson Y., Hayward R., Johanson M., van Rijswijck J., « Dead Cell Analysis in Hex and the Shannon Game », Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge (GT04 Paris), p. 45-60, 2007.
3. Browne C., Hex Strategy. Making the Right Connections, A K PETERS, 2000.
4. Bruegmann B., « Monte-Carlo Go », Report, 1993. http://citeseer.ist.psu.edu/637134.html.
5. Cazenave T., « A Generalized Threats Search Algorithm », Computers and Games 2002, vol. 2883 of Lecture Notes in Computer Science, Springer, Edmonton, Canada, p. 75-87, 2003.
6. Cazenave T., « Playing the Right Atari », ICGA Journal, vol. 30, no 1, p. 35-42, March, 2007.
7. Cazenave T., Jouandeau N., « On the parallelization of UCT », Computer Games Workshop 2007, Amsterdam, The Netherlands, p. 93-101, June, 2007.
8. Cazenave T., Jouandeau N., « A Parallel Monte-Carlo Tree Search Algorithm », Computers and Games, LNCS, Springer, Beijing, China, p. 72-80, 2008.
9. Chaslot G., Winands M. H. M., van den Herik H. J., « Parallel Monte-Carlo Tree Search », Computers and Games, vol. 5131 of Lecture Notes in Computer Science, Springer, p. 60-71, 2008.
10. Coulom R., « Efficient Selectivity and Back-up Operators in Monte-Carlo Tree Search », Computers and Games 2006, Volume 4630 of LNCS, Springer, Torino, Italy, p. 72-83, 2006.
11. Coulom R., « Computing Elo Ratings of Move Patterns in the Game of Go », ICGA Journal, vol. 30, no 4, p. 198-208, December, 2007.
12. Even S., Tarjan R. E., « A Combinatorial Problem Which is Complete in Polynomial Space », Journal of the Association for Computing Machinery, October, 1976.
13. Gale D., « The game of Hex and the Brouwer fixed-point theorem », Amer. Math. Monthly, vol. 86, no 10, p. 818-827, 1979.
14. Gelly S., Hoock J.-B., Rimmel A., Teytaud O., Kalemkarian Y., « The Parallelization of Monte-Carlo Planning », ICINCO, 2008.
15. Gelly S., Silver D., « Combining online and offline knowledge in UCT », ICML, p. 273-280, 2007.
16. Gelly S., Wang Y., Munos R., Teytaud O., Modification of UCT with Patterns in Monte-Carlo Go, Technical Report no 6062, INRIA, 2006.
17. Hexwiki, Website, 2008. http://www.hexwiki.org.
18. Kato H., Takeuchi I., « Parallel Monte-Carlo Tree Search with Simulation Servers », 13th Game Programming Workshop (GPW-08), November, 2008.
19. Kocsis L., Szepesvàri C., « Bandit based monte-carlo planning », ECML, vol. 4212 of Lecture Notes in Computer Science, Springer, p. 282-293, 2006.
20. Maarup T., Hex Everything You Always Wanted to Know About Hex But Were Afraid to Ask, Master's thesis, University of Southern Denmark, 2005.
21. Reisch S., « Hex ist PSPACE-vollständig », Acta Inf., vol. 15, p. 167-191, 1981.
22. Silver D., 2008. http://computer-go.org/pipermail/computer-go/2008- February/014095.html.
23. Thomsen T., « Lambda-search in game trees - with application to Go », ICGA Journal, vol. 23, no 4, p. 203-217, 2000.