Lecture
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.