Monte Carlo Tree Search

Created at 2018-09-07 Updated at 2018-09-07 Category Reinforcement Learning Tag Reinforcement Learning

Monte Carlo Tree Search(MCTS) is a powerful method to generate optimal policies for AI. There are four steps in MCTS

  1. Seletion: select a best action in current state using UCB
  2. Expension: expand tree node
  3. Simulation: roll out to estimate the value of current state
  4. Update: update(backpropagate) parameters

Some helpful videos:

Table of Content

Site by GoingMyWay using Hexo & Random

I am a ML and RL research student