Sciweavers

TCIAIG
2010
12 years 10 months ago
Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing
Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Gam...
Jean Méhat, Tristan Cazenave
TCIAIG
2010
12 years 10 months ago
Current Frontiers in Computer Go
This paper presents the recent technical advances in Monte-Carlo Tree Search for the Game of Go, shows the many similarities and the rare differences between the current best progr...
Arpad Rimmel, Olivier Teytaud, Chang-Shing Lee, Sh...
CG
2010
Springer
13 years 1 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...
CG
2010
Springer
13 years 1 months ago
Biasing Monte-Carlo Simulations through RAVE Values
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
CG
2010
Springer
13 years 1 months ago
Score Bounded Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
Tristan Cazenave, Abdallah Saffidine
CG
2008
Springer
13 years 5 months ago
A Parallel Monte-Carlo Tree Search Algorithm
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...
Tristan Cazenave, Nicolas Jouandeau
CG
2008
Springer
13 years 5 months ago
Monte-Carlo Tree Search Solver
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (L...
Mark H. M. Winands, Yngvi Björnsson, Jahn-Tak...
AIIDE
2008
13 years 6 months ago
Monte-Carlo Tree Search: A New Framework for Game AI
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
Guillaume Chaslot, Sander Bakkes, Istvan Szita, Pi...
ACG
2009
Springer
13 years 7 months ago
A Study of UCT and Its Enhancements in an Artificial Game
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
David Tom, Martin Müller
EUROGP
2010
Springer
330views Optimization» more  EUROGP 2010»
13 years 10 months ago
Bandit-Based Genetic Programming
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
Jean-Baptiste Hoock, Olivier Teytaud