Lecture
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 discusses the principles of alpha-beta pruning, the performance comparison with minimax, and the working principles of Monte-Carlo. It also contrasts Monte-Carlo with alpha-beta, highlighting their respective computational characteristics. 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