Universität Basel

Departement
Mathematik und Informatik

""

Lecture Slides

NoTopicDateSlides
0Organizational Matters18.2.screen
printer
1Introduction18.2.screen
printer
2Introduction: AI Past and Present20.2screen
printer
3Introduction: Rational Agents20.2.screen
printer
4Introduction: Environments and Problem Solving Methods25.2.screen
printer
5State-Space Search: State Spaces25.2.screen
printer
6State-Space Search: Representation of State Spaces27.2.screen
printer
7State-Space Search: Examples of State Spaces27.2.screen
printer
8State-Space Search: Data Structures for Search Algorithms4.3.screen
printer
9State-Space Search: Tree Search and Graph Search4.3.screen
printer
10State-Space Search: Breadth-first Search6.3.screen
printer
11State-Space Search: Uniform Cost Search6.3.screen
printer
12State-Space Search: Depth-first Search & Iterative
Deepening		18.3.screen
printer
13State-Space Search: Heuristics18.3.screen
printer
14State-Space Search: Analysis of Heuristics20.3.screen
printer
15State-Space Search: Best-first Graph Search20.3.screen
printer
16State-Space Search: Greedy BFS, A*, Weighted A*25.3.screen
printer
17State-Space Search: IDA*25.3.screen
printer
18State-Space Search: Properties of A*, Part I27.3.screen
printer
19State-Space Search: Properties of A*, Part II27.3.screen
printer
20Combinatorial Optimization: Introduction and Hill-Climbing1.4.screen
printer
21Combinatorial Optimization: Advanced Techniques1.4.screen
printer
22Constraint Satisfaction Problems: Introduction and
Examples		3.4.screen
printer
23Constraint Satisfaction Problems: Constraint Networks3.4.screen
printer
24Constraint Satisfaction Problems: Backtracking8.4.screen
printer
25Constraint Satisfaction Problems: Arc Consistency8.4.screen
printer
26Constraint Satisfaction Problems: Path Consistency10.4.screen
printer
27Constraint Satisfaction Problems: Constraint Graphs10.4.screen
printer
28Constraint Satisfaction Problems: Decomposition Methods15.4.screen
printer
29Propositional Logic: Basics15.4.screen
printer
30Propositional Logic: Reasoning and Resolution17.4.screen
printer
31Propositional Logic: DPLL Algorithm17.4.screen
printer
32Propositional Logic: Local Search and Outlook24.4.screen
printer
33Automated Planning: Introduction24.4.screen
printer
34Automated Planning: Planning Formalisms29.4.screen
printer
35Automated Planning: Delete Relaxation29.4.screen
printer
36Automated Planning: Delete Relaxation Heuristics6.5.screen
printer
37Automated Planning: Abstraction6.5.screen
printer
38Automated Planning: Landmarks8.5.screen
printer
39Automated Planning: Landmark Heuristics8.5.screen
printer
40Board Games: Introduction and State of the Art15.5.screen
printer
41Board Games: Minimax Search and Evaluation Functions15.5.screen
printer
42Board Games: Alpha-Beta Search20.5.screen
printer
43Monte-Carlo Tree Search: Introduction20.5.screen
printer
44Monte-Carlo Tree Search: Advanced Topics22.5.screen
printer
45AlphaGo and Outlook22.5.screen
printer
46AI Group Introduction27.5.screen

Supplementary Material

Chap.Description
1Turing: "Computation Machinery and Intelligence"
2Bowling et al.: "Heads-up Limit Hold’em Poker is Solved"
2DARPA challenge videos: 1, 2
2Silver et al.: "Mastering the game of Go with deep
neural networks and tree search" (*)
68-Puzzle: explicit graph, declarative representation, black box
6Delling et al.: "Engineering Route Planning Algorithms"
8Burns et al.: "Implementing Fast Heuristic Search Code"
10Korf and Schultze: "Large-Scale Parallel Breadth-First Search"
12Complexity estimation script
17Korf: "Depth-First Iterative Deepening: An Optimal Admissible Tree Search" (*)
19Dechter and Pearl: "Generalized Best-First Search Strategies and the Optimality of A*" (*)
22McGuire et al.: "There is no 16-Clue Sudoku"
22Numberphile video on Four Colour Problem
26Simonis: "Sudoku as a Constraint Problem"
31Davis, Logemann and Loveland: "A Machine Program for Theorem-Proving" (*)
32Katebi et al.: "Empirical Study of the Anatomy of Modern SAT Solvers"
32Bayless et al.: "SAT Modulo Monotonic Theories"
34Blocksworld PDDL model
36Keyder and Geffner: "Heuristics for Planning with Action Costs Revisited"
39Pommerening et al.: "Lagrangian Decomposition for Optimal Cost Partitioning"
40Shannon: "Programming a Computer for Playing Chess" (*)
42 Schaeffer et al.: "Checkers Is Solved" (*)
45Silver 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.

Nach oben