Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Page 3 of 3

Theory of Computation: Complexity of Problems

Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.

Dynamic Programming: Rod Cutting and Matrix Chain Multiplication

Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.

Learning from Probabilistic Models

Delves into challenges of learning from probabilistic models, covering computational complexity, data reconstruction, and statistical gaps.

Optimization and Simulation: Introduction to Simulation

Introduces state-of-the-art methods in optimization and simulation, covering topics like statistical analysis, variance reduction, and simulation projects.

Simulation & Optimization: Poisson Process & Random Numbers

Explores simulation pitfalls, random numbers, discrete & continuous distributions, and Monte-Carlo integration.

Replica Symmetry Breaking: Full Solution & Condensation

Explores Replica Symmetry Breaking in the Random Energy Model, discussing configurational entropy and condensation.

Generalization in Deep Learning

Delves into the trade-off between model complexity and risk, generalization bounds, and the dangers of overfitting complex function classes.

Monte Carlo Tree Search and Alpha Zero

Explores Monte Carlo Tree Search and Alpha Zero in deep reinforcement learning.

Theory of Computation: Decidability and Complexity

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.

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

Explores solving Connect Four using game theory and algorithms optimization, comparing minimax, alpha-beta pruning, and Monte-Carlo tree search.