Sign inSign in
ConceptAI & ML

Monte Carlo tree search

A search algorithm used in decision-making processes, particularly in games, that builds a search tree by simulating random playouts.
as Fei-Fei Li, Justin Johnson & Serena Yeung defines itStanford UniversityThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Search tree3Game theory1Markov decision processes1Monte-Carlo control1Monte-Carlo evaluation1Planning algorithms1Policy1Reinforcement learning1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Sergey Levine

    UC Berkeley · Undergraduate

    A planning method that considers closed-loop feedback and is commonly used for discrete states and board games.
    • 9:15Exploration of advanced topics in deep reinforcement learning
  • Sasha Rush

    Cornell University · Graduate

    A search algorithm combining search with exploration by walking down a tree to a leaf node, expanding next steps, running rollouts, and updating parent nodes.
    • 34:19Speculations on Test-Time Scaling for Large Language Models (o1)
  • David Silver

    Google DeepMind · Graduate

    An algorithm that builds a search tree using simulated trajectories and evaluates state-action pairs by mean returns to improve the simulation policy.
    • 1:20:00Integrating Learning and Planning

Lectures that assume it

1

Connections

13

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.