Sciweavers

209 search results - page 5 / 42
» Monte Carlo Go Has a Way to Go
Sort
View
EUROGP
2010
Springer
330views Optimization» more  EUROGP 2010»
14 years 1 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
CG
2008
Springer
13 years 8 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...
TCIAIG
2010
13 years 1 months ago
Monte Carlo Tree Search in Hex
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
Broderick Arneson, Ryan B. Hayward, Philip Henders...
CEC
2007
IEEE
14 years 1 months ago
Experiments with Monte Carlo Othello
— In this paper, we report on our experiments with using Monte Carlo simulation (specifically the UCT algorithm) as the basis for an Othello playing program. Monte Carlo methods ...
Philip Hingston, Martin Masek
ACG
2009
Springer
14 years 1 months ago
Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search
Abstract. We present a new exploration term, more efficient than classical UCT-like exploration terms. It combines efficiently expert rules, patterns extracted from datasets, All-M...
Guillaume Chaslot, Christophe Fiter, Jean-Baptiste...