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

Related lectures (28)

Explores challenges in control, safety, and coordination for autonomous systems like autonomous cars, focusing on safe learning and Nash equilibria.

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.

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

Covers multi-agent systems in traffic management and dynamic pricing strategies using game theory.

Covers learning dynamics in finite action games and explores various types of equilibria, including correlated and coarse correlated equilibria.

Explores Farkas' Lemma, hyperplane separation, combinatorics, and its application in game theory, focusing on penalty kick strategies.

Covers bidding strategies, Game Theory, Nash equilibrium, system security, ancillary services, and market power in power systems.

Page 2 of 2