Unverified50% confidenceConceptExact time
Monte Carlo tree search (MCTS) is an online planning method that estimates action values by repeatedly sampling in a decision tree.
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedSystems such as AlphaProof use the Monte Carlo Tree Search (MCTS) method, modeling proof search as a sequential decision-making problem.78% similarUnverifiedMonte Carlo Tree Search (MCTS) does not rely on manually designed evaluation functions; instead, it estimates the win rate of each move through a large number of random simulated games and uses the UCB formula to balance exploration and exploitation.74% similarUnverifiedMonte Carlo Tree Search (MCTS) was proposed by Rémi Coulom in 2006, and its core process consists of four stages: selection, expansion, simulation, and backpropagation.72% similarUnverifiedo系列引入蒙特卡洛树搜索（MCTS），该算法同样用于AlphaGo的棋局模拟68% similarUnverifiedPUCT 在每次选择节点时，除了利用 UCT 的探索-利用权衡项，还引入了一个基于策略网络的先验预测项，用来指导搜索往更有希望的分支扩展。66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1028957API
curl https://kongchang.com/api/v1/knowledge/claims/1028957MCP
get_claim(id=1028957)