Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Learn to implement a Monte Carlo Tree Search (MCTS) algorithm by building an AI agent that plays Tic-Tac-Toe in this 32-minute tutorial video. Explore the fundamental algorithm powering O1 models during inference, previously utilized in groundbreaking AI achievements like AlphaGo and AlphaZero. Follow along with a practical demonstration of MCTS implementation, understand its core mechanics, and discover how it compares to modern O1-preview and O1-mini models. Access the complete source code on GitHub to build and experiment with your own AI agent.