Name
Abstract | ||
|---|---|---|
Recent results have shown that the MCTS algorithm (a new, adaptive, randomized optimization algorithm) is effective in a remarkably diverse set of applications in Artificial Intelligence, Operations Research, and High Energy Physics. MCTS can find good solutions without domain dependent heuristics, using the UCT formula to balance exploitation and exploration. It has been suggested that the optimum in the exploitation-exploration balance differs for different search tree sizes: small search trees needs more exploitation; large search trees need more exploration. Small search trees occur in variations of MCTS, such as parallel and ensemble approaches. This paper investigates the possibility of improving the performance of Ensemble UCT by increasing the level of exploitation. As the search trees become smaller we achieve an improved performance. The results are important for improving the performance of large scale parallelism of MCTS. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.5220/0005711603700376 | ICAART 2016 Proceedings of the 8th International Conference on Agents and Artificial Intelligence |
Field | DocType | ISBN |
Monte Carlo tree search,Computer science,Heuristics,Artificial intelligence,Optimization algorithm,Machine learning,Search tree | Journal | 978-989-758-172-4 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| s ali mirsoleimani | 1 | 2 | 2.74 |
| Aske Plaat | 2 | 524 | 72.18 |
| H. Jaap van den Herik | 3 | 861 | 137.51 |