Reference 3 stops to get here · leads to 1

Monte Carlo Tree Search

A search algorithm combining tree search with random sampling, used in game-playing AIs.

Your route here

3 stops · basics first
  1. Machine Learning ✓ understood

    Building systems that learn patterns from data instead of following hand-written rules, getting better at a task as they see more examples.

  2. Reinforcement Learning ✓ understood

    Learning through interaction with an environment, receiving rewards or penalties to learn optimal behavior policies.

  3. Exploration vs Exploitation ✓ understood

    The RL dilemma of trying new actions (exploration) versus using known good actions (exploitation) to maximize reward.

  4. Monte Carlo Tree Search · you are here ✓ understood

A search algorithm combining tree search with random sampling, used in game-playing AIs.

This concept is essential for understanding emerging & advanced and forms a key part of modern AI systems.

  • AlphaGo
  • Game Playing
  • Search

Where it sits

Before this

Exploration vs Exploitation
Monte Carlo Tree Search

Leads to

AlphaGo

Explore nearby

Agents & RL AlphaGo DeepMind's Go-playing AI that defeated world champions using deep RL and tree search. Language & LLMs Beam Search A generation algorithm that maintains top-k candidates at each step, balancing quality and diversity. Agents & RL Model-Based RL Reinforcement learning using learned environment models for planning and improving sample efficiency. Agents & RL Value Function A function estimating expected cumulative reward from a state (state-value) or state-action pair (action-value/Q-value).

In the research

All papers →

A paper that builds on Monte Carlo Tree Search .