Monte Carlo tree search

E205830 UNEXPLORED

Monte Carlo tree search is a heuristic search algorithm that uses random sampling of game states to build and explore a search tree, enabling strong decision-making in complex domains like Go and other board games.

Jump to: Surface forms Referenced by

Observed surface forms (1)

Surface form	Occurrences
Monte Carlo Tree Search	2

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

AlphaZero → basedOn → Monte Carlo tree search ⓘ

MuZero → basedOn → Monte Carlo tree search ⓘ

this entity surface form: Monte Carlo Tree Search

David Silver → researchInterest → Monte Carlo tree search ⓘ

MuZero → usesAlgorithm → Monte Carlo tree search ⓘ

this entity surface form: Monte Carlo Tree Search