Unit 2: Adversarial Search and Bayesian Learning

Unit 2 Overview

Duration: 10 Lecture Hours

Topics

Topic	Description
2.1 Adversarial Search	Minimax, Alpha-Beta Pruning, CSP
2.2 Bayesian Learning	Bayes Theorem, Naive Bayes, BBN, EM Algorithm

Learning Outcomes

Apply minimax for optimal decisions in two-player games
Use alpha-beta pruning to improve minimax efficiency
Apply Bayes theorem for classification
Implement Naive Bayes classifier
Understand Bayesian Belief Networks

Back to Course Overview