Solving Connect Four: Game Theory Strategies

This lecture presents the application of game theory to solve the two-player zero-sum game Connect Four. Starting with the minimax algorithm, the instructor optimizes it using alpha-beta pruning and compares it with the Monte-Carlo tree search algorithm. The lecture discusses the principles of alpha-beta pruning, the differences between minimax and alpha-beta pruning in terms of running time, and the principles of Monte Carlo methods. It also compares Monte Carlo with alpha-beta in terms of systematic computing, information processing, and computational efficiency. The lecture concludes with acknowledgments to individuals who supported the project.