Game Playing 1 - Minimax, Alpha-beta Pruning | Stanford CS221: AI (Autumn 2019)
1:19:25
Game Playing 2 - TD Learning, Game Theory | Stanford CS221: Artificial Intelligence (Autumn 2019)
1:23:07
Markov Decision Processes 1 - Value Iteration | Stanford CS221: AI (Autumn 2019)
1:21:17
Factor Graphs 1 - Constraint Satisfaction Problems | Stanford CS221: AI (Autumn 2019)
1:21:54
Search 2 - A* | Stanford CS221: Artificial Intelligence (Autumn 2019)
1:23:45
Bayesian Networks 3 - Maximum Likelihood | Stanford CS221: AI (Autumn 2019)
48:17
6. Search: Games, Minimax, and Alpha-Beta
1:20:25
Search 1 - Dynamic Programming, Uniform Cost Search | Stanford CS221: AI (Autumn 2019)
1:27:26