Solving Connect Four: A-B Pruning and Monte-Carlo Tree Search

Related lectures (30)

Provides guidance on project proposals in game theory, showcasing past examples and emphasizing problem formulation and mathematical modeling.

Covers potential games, their properties, and the convergence of best-response dynamics to Nash equilibria.

Covers the basics of static games and introduces key game theory concepts, including the Prisoner's Dilemma and Nash Equilibrium.

Covers zero-sum games, focusing on Nash equilibria, security strategies, and their applications in various scenarios.

Explores multistage games, focusing on extensive form and feedback strategies, including Nash equilibria and backward induction methods.

Covers dynamic games, focusing on backward induction and finding Nash equilibria in two-player scenarios.

Covers dynamic games, focusing on their structure, applications, and the transition from tree to loop models.

Explores zero-sum games and the minimax theorem in Game Theory, emphasizing optimal strategies.

Explains binary search, the logarithm function, and recursive algorithms for factorial and Fibonacci sequences.

Covers convex games, their equilibria, and applications in various fields such as traffic and electricity markets.

Page 2 of 2