most citedMonte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups

6 citations · 6 across the 1 of their papers we have counts for

collaborators

1 paper

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…