76 search results - page 3 / 16 » Monte-Carlo Tree Search Solver |
AAAI
2010
13 years 7 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
AAAI
2012
11 years 8 months ago
2012
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...
ICGA
2008
13 years 6 months ago
2008
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....
ACG
2009
Springer
14 years 1 months ago
2009
Springer
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...
ACG
2009
Springer
14 years 1 months ago
2009
Springer
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...