Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Lecture

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

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (38)

Connect Four: Game Theory Approach Log in to Mediaspace to watch this video

Explores solving Connect Four using game theory algorithms to find optimal strategies efficiently.

Optimization algorithms Log in to Mediaspace to watch this video

Covers optimization algorithms, focusing on Proximal Gradient Descent and its variations.

Variance Reduction: Strategies and Applications Log in to Mediaspace to watch this video

Discusses variance reduction techniques in stochastic simulation, focusing on allocation strategies and replica generation algorithms.

Solving Connect Four: A-B Pruning and Monte-Carlo Tree Search Log in to Mediaspace to watch this video

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

Deliberative Agents: Planning and Strategies Log in to Mediaspace to watch this video

Covers planning with adversaries, heuristic search algorithms, and strategies for games with chance, emphasizing the significance of deliberative agents.

Linear Programming: Solving LPs Log in to Mediaspace to watch this video

Covers the process of solving Linear Programs (LPs) using the simplex method.

Code Optimization: Speeding-up Analyses Log in to Mediaspace to watch this video

Explores techniques to speed up dataflow analyses and discusses the importance of node ordering and post-order traversal.

Optimization in Large Search Spaces: GPU-Accelerated Join Order Log in to Mediaspace to watch this video

Explores GPU-accelerated join order optimization in large search spaces, leveraging graph topology to reduce computational overheads.

Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search Log in to Mediaspace to watch this video

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

Distributed Computing Execution Models Log in to Mediaspace to watch this video

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

Simplex Algorithm: Basics Log in to Mediaspace to watch this video

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

RTR practical aspects + tCG Log in to Mediaspace to watch this video

Explores practical aspects of Riemannian trust-region optimization and introduces the truncated conjugate gradient method.

Gradient Descent Log in to Mediaspace to watch this video

Covers the concept of gradient descent, a universal algorithm used to find the minimum of a function.

Introduction to Optimization Log in to Mediaspace to watch this video

Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.

Advanced Metaprogramming Queries: Code Volume & Complexity Log in to Mediaspace to watch this video

Explores managing large codebases, higher abstraction levels, CodeDB, Datalog queries, and program analysis.

The Hessian and Newton's method Log in to Mediaspace to watch this video

Covers the Hessian and Newton's method for optimization using iterative processes.

Binary Search: Logarithm Function Log in to Mediaspace to watch this video

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

Learning the Kernel Solution: MGT-418 Tutorial Log in to Mediaspace to watch this video

Explores learning the kernel solution in convex optimization, focusing on predicting outputs using a linear classifier and addressing possible numerical issues.

Page 2 of 2