Connect Four: Game Theory Approach

This lecture presents a project on solving the Connect Four game using alpha-beta pruning and Monte-Carlo tree search algorithms. Starting with the minimax algorithm, the instructors optimize the strategy to find the most efficient solution. By comparing the algorithms, they aim to determine the optimal strategy in minimal time. The lecture covers the principles of alpha-beta pruning and Monte-Carlo tree search, showcasing their advantages and disadvantages. Through extensive testing and analysis, the instructors demonstrate the effectiveness of these algorithms in solving the game. Special thanks are given to individuals who supported the project, highlighting the collaborative nature of the research.