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

Related lectures (31)

Page 3 of 4

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

Covers potential games, best response dynamics, and the convergence to Nash equilibria.

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

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.

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

Explores theoretical and practical aspects of fast matrix-matrix multiplication algorithms and their significance in computer science.

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