Lecture
Solving Connect Four: A-B Pruning and Monte-Carlo Tree Search
Description
This lecture presents a project by Gouraud Julien and Ruzza Riccardo from the Systems Control and Multiagent Optimization Research lab. They aim to apply game theory to find the optimal strategy for the two-player game Connect Four using minimax algorithm, alpha-beta pruning, and Monte-Carlo tree search. The lecture compares the performance of these algorithms in terms of running time and computational efficiency.
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 MediaspaceOfficial source
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.