85 search results - page 3 / 17 » Heuristics in Monte Carlo Go |
ACG
2006
Springer
13 years 12 months ago
2006
Springer
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
TCIAIG
2010
13 years 21 days ago
2010
CEC
2007
IEEE
14 years 9 days ago
2007
IEEE
— 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 ...
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....
AI
2008
Springer
13 years 6 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...