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

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (31)

Page 3 of 4

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

Explores solving Connect Four using game theory and algorithms for optimal strategy in minimum time.

Introduction to Algorithms

Explores the ingredients and selection of algorithms for different goals.

Transporters: a proxy for parallel transport

Explores transporters as a practical alternative to parallel transport, discussing minimal requirements, examples with matrices, pragmatic choices, and optimization algorithms.

Coin Change Problem

Explores the coin change problem, comparing greedy and dynamic programming algorithms for optimal solutions.

Optimization Algorithms: Greedy Approach

Explores optimization problems and greedy algorithms for efficient decision-making.

Energy Systems Optimization

Explores energy systems modeling, optimization, and cost analysis for efficient operations.

Distributed Computing Execution Models

Explores challenges in minimizing job completion time in distributed computing, focusing on data skew impact and efficient processing.

Optimization with Constraints: KKT Conditions

Covers the optimization with constraints, focusing on the Karush-Kuhn-Tucker (KKT) conditions.

Taylor Expansions: First Order

Explores Taylor expansions of first order in optimization on manifolds.

Simplex Algorithm: Basics

Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.