Knowledge complement for Monte Carlo Tree Search: an application to combinatorial games

André Fabbri 1 Frédéric Armetta 1 Eric Duchêne 2 Salima Hassas 1
1 SMA - Systèmes Multi-Agents
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
2 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : MCTS (Monte Carlo Tree Search) is a well-known and efficient process to cover and evaluate a large range of states for combinatorial problems. We choose to study MCTS for the Computer Go problem, which is one of the most challenging problem in the field in Artificial Intelligence. For this game, a single combinatorial approach does not always lead to a reliable evaluation of the game states. In order to enhance MCTS ability to tackle such problems, one can benefit from game specific knowledge in order to increase the accuracy of the game state evaluation. Such a knowledge is not easy to acquire.It is the result of a constructivist learning mechanism based on the experience of the player. That is why we explore the idea to endow the MCTS with a process inspired by constructivist learning, to self-acquire knowledge from playing experience.In this paper, we propose a complementary process for MCTS called BHRF (Background History Reply Forest), which allows to memorize efficient patterns in order to promote their use through the MCTS process. Our experimental results lead to promising results and underline how self-acquired data can be useful for MCTS based algorithms.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01083449
Contributor : André Fabbri <>
Submitted on : Wednesday, December 10, 2014 - 10:22:53 AM
Last modification on : Wednesday, November 20, 2019 - 3:14:57 AM
Long-term archiving on : Friday, April 14, 2017 - 1:29:17 PM

Files

bhrf_ictai2014_HAL.pdf
Files produced by the author(s)

Identifiers

Citation

André Fabbri, Frédéric Armetta, Eric Duchêne, Salima Hassas. Knowledge complement for Monte Carlo Tree Search: an application to combinatorial games. 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, Nov 2014, Limassol, Cyprus. pp.997-1003, ⟨10.1109/ICTAI.2014.151⟩. ⟨hal-01083449⟩

Share

Metrics

Record views

394

Files downloads

320