Loading video...
Video Failed to Load
Every variant of Monte Carlo Tree Search faces the explore-exploit tradeoff: pick the branch that looks best right now, or test new branches? Algorithms like PUCT, used in AlphaGo, score each move with two competing terms. One is how good a move looks based on your exploration up till... show more
19,995 views • 2 months ago •via X (Twitter)
0 Comments
No comments available
Comments from the original post will appear here
