Important Links
Lecture Slides
| No | Topic | Date | Slides |
|---|---|---|---|
| A1 | Organizational Matters | 16.02. | screen printer handout |
| A2 | What is Artificial Intelligence? | 16.02. | screen printer handout |
| A3 | AI Past and Present | 18.02. | screen printer handout |
| A4 | Rational Agents | 18.02. | screen printer handout |
| A5 | Environments and Problem Solving Methods | 02.03. | screen printer handout |
| B1 | State Spaces | 02.03. | screen printer handout |
| B2 | Representation of State Spaces | 04.03. | screen printer handout |
| B3 | Examples of State Spaces | 04.03. | screen printer handout |
| B4 | Data Structures for Search Algorithms | 09.03. | screen printer handout |
| B5 | Tree Search and Graph Search | 09.03. | screen printer handout |
| B6 | Breadth-first Search | 11.03. | screen printer handout |
| B7 | Uniform Cost Search | 11.03. | screen printer handout |
| B8 | Depth-first Search & Iterative Deepening | 16.03. | screen printer handout |
| B9 | Heuristics | 16.03. | screen printer handout |
| B10 | Analysis of Heuristics | 18.03. | screen printer handout |
| B11 | Best-first Graph Search | 18.03. | screen printer handout |
| B12 | Greedy Best-first Search, A*, Weighted A* | 23.03. | screen printer handout |
| B13 | IDA* | 23.03. | screen printer handout |
| B14 | Properties of A*, Part 1 | 25.03. | screen printer handout |
| B15 | Properties of A*, Part 2 | 25.03. | screen printer handout |
| c1 | Combinatorial Optimization: Introduction and Hill-Climbing | 30.03. | screen printer handout |
| c2 | Advanced Techniques | 30.03. | screen printer handout |
| D1 | Constraint Satisfaction Problems: Introduction and Examples | 01.04. | screen printer handout |
| D2 | Constraint Networks | 01.04. | screen printer handout |
| d3 | Backtracking | 08.04. | screen printer handout |
| d4 | Inference and Forward Checking | 08.04. | screen printer handout |
| d5 | Arc Consistency | 13.04. | screen printer handout |
| d6 | Path Consistency | 13.04. | screen printer handout |
| d7 | Constraint Graphs | 15.04. | screen printer handout |
| d8 | Decomposition Methods | 15.04. | screen printer handout |
| E1 | Propositional Logic: Syntax and Semantics | 20.04. | screen printer handout |
| E2 | Equivalence, Normal Forms, and Reasoning | 20.04. | screen printer handout |
| E3 | Resolution | 22.04. | screen printer handout |
| E4 | DPLL Algorithm | 22.04. | screen printer handout |
| E5 | Local Search and Outlook | 27.04. | screen printer handout |
| F1 | Automated Planning: Introduction | 27.04. | screen printer handout |
| F2 | Planning Formalisms | 29.04. | screen printer handout |
| F3 | Delete Relaxation | 29.04. | screen printer handout |
| F4 | Delete Relaxation Heuristics | 04.05. | screen printer handout |
| F5 | Abstraction | 04.05. | screen printer handout |
| F6 | Abstraction Heuristics | 06.05. | screen printer handout |
| G1 | Board Games: Introduction and State of the Art | 06.05. | screen printer handout |
| G2 | Formal Definition and Minimax Search | 11.05. | screen printer handout |
| G3 | Evaluation Functions | 11.05. | screen printer handout |
| G4 | Alpha-Beta Search | 13.05. | screen printer handout |
| G5 | Stochastic Games | 13.05. | screen printer handout |
| G6 | Monte-Carlo Tree Search Framework | 18.05. | screen printer handout |
| G7 | Monte-Carlo Tree Search Variants | 18.05. | screen printer handout |
| Complete Slide Set | screen printer handout |
Exercises
are provided via ADAM