| Artificial Intelligence: A Modern Approach |
| Chap | Topic | Demos |
|---|---|---|
| 3-4 | Search | MIT / UBC |
| 3 | Search trees | RMIT |
| 3 | A* Search | 8/16-puzzle / 8-puzzle |
| 4 | Genetic Algorithms | TSP / Plant Eaters |
| 5 | CSPs (Map coloring) | MIT / UBC |
| 6 | Minimax and Alpha-Beta | MIT |
| 6 | Checkers | Chinook |
| 6 | Othello | Ajax / Cyrano / Chirico |
| 9 | Definite Clause Deduction | UBC |
| 11 | Strips Planning | UBC |
| 12 | Continuous Planning | Koenig |
| 14 | Belief Networks | UBC / JavaBayes |
| 17 | Markov Decision Processes | UBC |
| 18 | Decision Trees | Alberta / UBC |
| 20 | Neural Networks | UBC |
| 20 | Support Vector (Kernel) Machines | MIT |
| 21 | Reinforcement Learning | Blackjack |
| 25 | Robotic Control | UBC |
| 26 | Art | Aaron |
| AI: A Modern Approach by Stuart Russell and Peter Norvig | Modified: Sep 21, 2003 |