Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search
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 of Monte-Carlo, the differences between Monte-Carlo and Alpha-Beta, and the performance comparison between the algorithms. 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