Monte-Carlo Expression Discovery

Monte-Carlo Tree Search is a general search algorithm that gives good results in games. Genetic Pro-gramming evaluates and combines trees to discover expressions that maximize a given fitness function. In this paper Monte-Carlo Tree Search is used to generate expressions that are evaluated in the same way as in Genetic Programming. Monte-Carlo Tree Search is transformed in order to search expression trees rather than lists of moves. We compare Nested Monte-Carlo Search to UCT (Upper Confidence Bounds for Trees) for various problems. Monte-Carlo Tree Search achieves state of the art results on multiple benchmark problems. The proposed approach is simple to program, does not suffer from ex-pression growth, has a natural restart strategy to avoid local optima and is extremely easy to parallelize. [ABSTRACT FROM AUTHOR]

[1]  Riccardo Poli,et al.  Why Ants are Hard , 1998 .

[2]  Tristan Cazenave,et al.  Nested Monte-Carlo Expression Discovery , 2010, ECAI.

[3]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[4]  Jean Méhat,et al.  Ary, a general game playing program , 2010 .

[5]  Tristan Cazenave,et al.  Nested Monte-Carlo Search , 2009, IJCAI.

[6]  David Silver,et al.  Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Achieving Master Level Play in 9 × 9 Computer Go , 2022 .

[7]  Jean Méhat,et al.  Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[8]  Ryan B. Hayward,et al.  Monte Carlo Tree Search in Hex , 2010, IEEE Transactions on Computational Intelligence and AI in Games.

[9]  Tristan Cazenave,et al.  Utilisation de la recherche arborescente Monte-Carlo au Hex , 2009, Rev. d'Intelligence Artif..

[10]  Rémi Coulom,et al.  Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.

[11]  Yngvi Björnsson,et al.  Simulation-Based Approach to General Game Playing , 2008, AAAI.

[12]  Heinrich Werner.  Discriminator-algebras : algebraic representation and model theoretic properties , 1978 .

[13]  Csaba Szepesvári,et al.  Bandit Based Monte-Carlo Planning , 2006, ECML.

[14]  David M. Clark,et al.  Genetic programming for finite algebras , 2008, GECCO '08.

[15]  R. Korf.  An Optimal Admissible Tree Search , 1985 .

[16]  Jean Méhat,et al.  A Parallel General Game Player , 2010, KI - Künstliche Intelligenz.

[17]  W. Langdon.  An Analysis of the MAX Problem in Genetic Programming , 1997 .

[18]  Todd Ebert,et al.  Applications of recursive operators to randomness and complexity , 1998 .

[19]  Graham Kendall,et al.  A Puzzle to Challenge Genetic Programming , 2002, EuroGP.

[20]  Christopher D. Rosin,et al.  Nested Rollout Policy Adaptation for Monte Carlo Tree Search , 2011, IJCAI.

[21]  Julian Francis Miller,et al.  Predicting Prime Numbers Using Cartesian Genetic Programming , 2007, EuroGP.