6 citations · 6 across the 2 of their papers we have counts for
2 papers
stat.ML2026
An Efficient Algorithm for Thresholding Monte Carlo Tree Search
Shoma Nameki, Atsuyoshi Nakamura, Junpei Komiyama +1
We introduce the Thresholding Monte Carlo Tree Search problem, in which, given a tree and a threshold , a player must answer whether the root node value of $\mathc…
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…