Lecture

Monte Carlo Tree Search and Alpha Zero

Description

This lecture covers the concepts of Monte Carlo Tree Search (MCTS) and Alpha Zero, two key algorithms in deep reinforcement learning. It explains how MCTS involves selection, expansion, simulation, and backpropagation, while Alpha Zero utilizes visit counts, action values, and prior action probabilities to make decisions in games like Chess, Shogi, and Go.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.