Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This lecture presents the application of game theory to solve Connect Four using the minimax algorithm, optimizing it with alpha-beta pruning, and comparing it with the Monte-Carlo tree search algorithm. The lecture also covers the principles and differences between Monte-Carlo and Alpha-Beta approaches, along with performance comparisons. Special thanks are given to Anna Maddux, Giulio Salizzoni, and Professor Maryam Kamgarpour for their support.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace