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.
Lecture
Solving Connect Four: A-B Pruning and Monte-Carlo Tree Search
Description
This lecture presents the application of game theory to solve Connect Four using the minimax algorithm, alpha-beta pruning, and Monte-Carlo tree search. The comparison of these algorithms is discussed, along with their running times and principles. Acknowledgments are given at the end.
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.