Lecture Foundations of Artificial Intelligence | Department of Mathematics and Computer Science

Important Links

Lecture Slides


No	Topic	Date	Slides
0	Organizational Matters	21.2.	screen printer
1	Introduction	21.2.	screen printer
2	Introduction: AI Past and Present	23.2.	screen printer
3	Introduction: Rational Agents	23.2.	screen printer
4	Introduction: Environments and Problem Solving Methods	28.2.	screen printer
5	State-Space Search: State Spaces	28.2.	screen printer
6	State-Space Search: Representation of State Spaces	2.3.	screen printer
7	State-Space Search: Examples of State Spaces	2.3.	screen printer
8	State-Space Search: Data Structures for Search Algorithms	14.3.	screen printer
9	State-Space Search: Tree Search and Graph Search	14.3.	screen printer
10	State-Space Search: Breadth-first Search	16.3.	screen printer
11	State-Space Search: Uniform Cost Search	16.3.	screen printer
12	State-Space Search: Depth-first Search & Iterative Deepening	21.3.	screen printer
13	State-Space Search: Heuristics	21.3.	screen printer
14	State-Space Search: Analysis of Heuristics	23.3.	screen printer
15	State-Space Search: Best-first Graph Search	23.3.	screen printer
16	State-Space Search: Greedy BFS, A, Weighted A	28.3.	screen printer
17	State-Space Search: IDA*	28.3.	screen printer
18	State-Space Search: Properties of A*, Part I	30.3.	screen printer
19	State-Space Search: Properties of A*, Part II	30.3.	screen printer
20	Combinatorial Optimization: Introduction and Hill-Climbing	4.4.	screen printer
21	Combinatorial Optimization: Advanced Techniques	4.4.	screen printer
22	Constraint Satisfaction Problems: Introduction and Examples	6.4.	screen printer
23	Constraint Satisfaction Problems: Constraint Networks	6.4.	screen printer
24	Constraint Satisfaction Problems: Backtracking	11.4.	screen printer
25	Constraint Satisfaction Problems: Arc Consistency	11.4.	screen printer
26	Constraint Satisfaction Problems: Path Consistency	13.4.	screen printer
27	Constraint Satisfaction Problems: Constraint Graphs	13.4.	screen printer
28	Constraint Satisfaction Problems: Decomposition Methods	20.4.	screen printer
29	Propositional Logic: Basics	20.4.	screen printer
30	Propositional Logic: Reasoning and Resolution	25.4.	screen printer
31	Propositional Logic: DPLL Algorithm	27.4.	screen printer
32	Propositional Logic: Local Search and Outlook	27.4.	screen printer
33	Automated Planning: Introduction	2.5.	screen printer
34	Automated Planning: Planning Formalisms	2.5.	screen printer
35	Automated Planning: Delete Relaxation	4.5.	screen printer
36	Automated Planning: Delete Relaxation Heuristics	4.5.	screen printer
37	Automated Planning: Abstraction	9.5.	screen printer
38	Automated Planning: Landmarks	11.5.	screen printer
39	Automated Planning: Landmark Heuristics	11.5.	screen printer
40	Board Games: Introduction and State of the Art	16.5.	screen printer
41	Board Games: Minimax Search and Evaluation Functions	16.5.	screen printer
42	Board Games: Alpha-Beta Search	18.5.	screen printer
43	Board Games: Introduction to Monte-Carlo Tree Search	18.5.	screen printer
44	Board Games: Advanced Topics in Monte-Carlo Tree Search	23.5.	screen printer
45	Board Games: AlphaGo and Outlook	23.5.	screen printer
	Research Group Artificial Intelligence: Introducing Ourselves	25.5.	screen

Exercises

No	Due Date	Files
1	27.2.	Sheet
2	6.3.	Sheet state-spaces.zip
3	20.3.	Sheet uniform-cost-search.zip
4	27.3.	Sheet
5	3.4.	Sheet best-first-search.zip
6	10.4.	Sheet hill-climbing.zip
7	17.4.	Sheet
8	24.4.	Sheet cantons.dot
9	1.5.	Sheet
10	8.5.	Sheet blocks-world.zip
11	15.5.	Sheet
12	22.5.	Sheet
Bonus	29.5.	Sheet sliding-tiles-problems.zip vertex-cover-problems.zip

Supplementary Material

Chap.	Description
1	Turing: "Computation Machinery and Intelligence"
2	Bowling et al.: "Heads-up Limit Hold’em Poker is Solved"
2	DARPA challenge videos: 1, 2
2	Silver et al.: "Mastering the game of Go with deep neural networks and tree search" (*)
6	8-Puzzle: explicit graph, declarative representation, black box
6	Delling et al.: "Engineering Route Planning Algorithms"
8	Burns et al.: "Implementing Fast Heuristic Search Code"
10	Korf and Schultze: "Large-Scale Parallel Breadth-First Search"
12	Complexity estimation script
17	Korf: "Depth-First Iterative Deepening: An Optimal Admissible Tree Search" (*)
17	Helmert et al.: "Iterative Budgeted Exponential Search"
19	Dechter and Pearl: "Generalized Best-First Search Strategies and the Optimality of A" ()
20	Hill climbing script
21	Hill climbing with stagnation script
21	Hill climbing with stagnation and random file script
22	McGuire et al.: "There is no 16-Clue Sudoku"
22	Numberphile video on Four Colour Problem
26	Simonis: "Sudoku as a Constraint Problem"
31	Davis, Logemann and Loveland: "A Machine Program for Theorem-Proving" (*)
32	Katebi et al.: "Empirical Study of the Anatomy of Modern SAT Solvers"
32	Bayless et al.: "SAT Modulo Monotonic Theories"
34	Blocksworld PDDL model
36	Keyder and Geffner: "Heuristics for Planning with Action Costs Revisited"
40	Shannon: "Programming a Computer for Playing Chess" (*)
41	Giambatista Lolli: "Osservazioni teorico-pratiche sopra il Giuoco degli Scacchi ossia il Giuoco degli scacchi eposta nel suo miglior lume"
42	Schaeffer et al.: "Checkers Is Solved" (*)
42	Alpha-Beta best-case script
45	Silver et al.: "Mastering the game of Go with deep neural networks and tree search" (*)

(*) Please get in touch with us if you are interested in this material. For copyright reasons, we are not allowed to make it available online.

To top

Important Links

Lecture Slides

Exercises

Supplementary Material

Social Media