Sciweavers

146 search results - page 4 / 30
» Parallel Monte-Carlo Tree Search
Sort
View
AAAI
2012
11 years 8 months ago
Generalized Monte-Carlo Tree Search Extensions for General Game Playing
General Game Playing (GGP) agents must be capable of playing a wide variety of games skillfully. Monte-Carlo Tree Search (MCTS) has proven an effective reasoning mechanism for thi...
Hilmar Finnsson
ICGA
2008
208views Optimization» more  ICGA 2008»
13 years 6 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
ACG
2009
Springer
14 years 27 days 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...
ACG
2009
Springer
14 years 27 days ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
ACML
2009
Springer
14 years 27 days ago
Monte-Carlo Tree Search in Poker Using Expected Reward Distributions
Guy Van den Broeck, Kurt Driessens, Jan Ramon