Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search
Graph Chatbot
Related lectures (30)
Previous
Page 1 of 3
Next
Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search
Explores solving Connect Four using game theory algorithms and compares Alpha-Beta pruning with Monte-Carlo tree search.
Elements of computational complexity
Covers classical and quantum computational complexity concepts and implications.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Energy System Modelling: Overview and Optimization Problems
Covers energy system modelling, optimization, scenarios, predictions, complexities, and controversies in energy models.
Optimization: Classical Problems
Covers classical optimization problems, brute force algorithms, and integer linear optimization.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Subquadratic Attention Mechanisms: State Space Models Overview
Covers subquadratic attention mechanisms and state space models, focusing on their theoretical foundations and practical implementations in machine learning.
Simulating Molecular Biology: Challenges and Opportunities
Explores simulating molecular biology dynamics, addressing challenges and opportunities in computational research.
Optimization Algorithms
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Dynamic Programming: Knapsack
Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
