6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.AI2021
Split Moves for Monte-Carlo Tree Search
Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik +3
In many games, moves consist of several decisions made by the player. These decisions can be viewed as separate moves, which is already a common practice in multi-action games for…
cs.AI2014★ 6 cited
Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups
Marc Lanctot, Mark H. M. Winands, Tom Pepels +1
Monte Carlo Tree Search (MCTS) has improved the performance of game engines in domains such as Go, Hex, and general game playing. MCTS has been shown to outperform classic alpha-be…