Transpositions and move groups in monte carlo tree search

2008 IEEE Symposium on Computational Intelligence and Games, CIG 2008

Volumn , Issue , 2008, Pages 389-395

  Childs, Benjamin E ^a   Brodeur, James H ^a   Kocsis, Levente ^b  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING FACTORS; GRAPH STRUCTURES; MONTE CARLO; OTHER APPLICATIONS; TREE SEARCH; UPPER CONFIDENCE BOUND;

ARTIFICIAL INTELLIGENCE; GAME THEORY; GRAPHIC METHODS; MONTE CARLO METHODS;

GRAPH THEORY;

EID: 70349285005     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2008.5035667     Document Type: Conference Paper

References (19)

1. L. Kocsis and C. Szepesv́ari, "Bandit based Monte-Carlo planning," in Proceedings of ECML-06, LNCS/LNAI 4212, 2006, pp. 282-293.
2. S. Gelly and D. Silver, "Achieving master level play in 9 × 9 computer go," in Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008, pp. 1537-1540.
3. H. Finnsson and Y. Björnsson, "Simulation-based approach to general game playing," in Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008, pp. 259-264.
4. P.-A. Coquelin and R. Munos, "Bandit algorithms for tree search," in Proc. 23rd Conference on Uncertainty in Artificial Intelligence (UAI), 2007, pp. 67-74.
5. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. Schapire, "The nonstochastic multiarmed bandit problem," SIAM Journal on Computing, vol.32, pp. 48-77, 2002.
6. D. Breuker, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Replacement schemes for transposition tables," ICCA Journal, vol.17, no.4, pp. 183-193, 1994.
7. B. Bouzy, "Old-fashioned computer Go vs Monte-Carlo Go," in Invited tutorial, IEEE 2007 Symposium on Computational Intelligence in Games, CIG 07, 2007. [Online]. Available: http: //www.mathinfo.univ-paris5.fr/bouzy/ publications/CIG07-tutorial-1avril2007.ppt
8. P. Drake, "Proposed uct/transposition table implementation." [Online]. Available: http: //computer-go.org/pipermail/computer-go/2006- December/007305.html
9. J.-T. Saito, M. H. Winands, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Grouping nodes for Monte-Carlo tree search," in BNAIC 2007, 2007, pp. 276-283.
10. D. M. Breuker, H. J. V. D. Herik, J. W. H. M. Uiterwijk, and L. V. Allis, "A solution to the ghi problem for best-first search," Theoretical Computer Science, vol.252, no.1-2, pp. 121-149, 2001.
11. A. Kishimoto and M. Müller, "A general solution to the graph history interaction problem," in Nineteenth National Conference on Artificial Intelligence (AAAI'04), 2004, pp. 644-649.
12. R. Sutton and A. Barto, Reinforcement Learning: An Introduction, ser. Bradford Book. MIT Press, 1998.
13. J. Kloetzer, H. Iida, and B. Bouzy, "The Monte-Carlo approach in Amazons," in Proceedings of the Computer Games Workshop, 2007, pp. 185-192.
14. S. Smith and D. Nau, "An analysis of forward pruning," in AAAI, 1994, pp. 1386-1391.
15. M. Müller, "Computer Go," Artificial Intelligence, vol.134, no.1-2, pp. 145-179, 2002.
16. B. Bruegmann, "Monte Carlo Go," 1993. [Online]. Available: ftp://ftp-igs.joyjoy.net/go/computer/mcgo.tex.Z
17. B. Bouzy and B. Helmstetter, "Monte-Carlo Go developments," in Advances in Computer Games conference (ACG-10). Kluwer Academic, 2003, pp. 159-174.
18. L. Lew, "Library for effective go routines." [Online]. Available: http://www.mimuw.edu.pl/~lew/hg/libego
19. "GNU Go." [Online]. Available: http://www.gnu.org/software/ gnugo/gnugo.html 2008.