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
Connect Four: α-β Pruning vs Monte-Carlo Tree Search
Description
This lecture presents the application of game theory to solve Connect Four using the minimax algorithm, optimized with α-β pruning, and compared with the Monte-Carlo tree search algorithm. The lecture covers the motivation, principles, and performance analysis of these strategies, concluding with acknowledgments.
Official 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.