Universität Basel

Departement
Mathematik und Informatik

Suche
""

Important Links

Lecture Slides

    
    
NoTopicDateSlides
0Organizational Matters20.02.screen
printer
1What is Artificial Intelligence?20.02.screen
printer
2AI Past and Present21.02.screen
printer
3Rational Agents21.02.screen
printer
4Introduction: Environments and Problem Solving Methods06.03.screen
printer
5State-Space Search: State Spaces06.03.screen
printer
6State-Space Search: Representation of State Spaces08.03.screen
printer
7State-Space Search: Examples of State Spaces08.03.screen
printer
8State-Space Search: Data Structures for Search Algorithms13.03.screen
printer
9State-Space Search: Tree Search and Graph Search13.03.screen
printer
10State-Space Search: Breadth-first Search15.03.screen
printer
11State-Space Search: Uniform Cost Search15.03.screen
printer
12State-Space Search: Depth-first Search & Iterative Deepening20.03.screen
printer
13State-Space Search: Heuristics20.03.screen
printer
14State-Space Search: Analysis of Heuristics22.03

screen
printer

15State-Space Search: Best-first Graph Search22.03screen
printer
16State-Space Search: Greedy BFS, A* , Weighted A*27.03.screen
printer
17State-Space Search: IDA*27.03.screen
printer
18Properties of A∗ , Part I29.03.screen
printer
19Properties of A∗ , Part II29.03.screen
printer
20Combinatorial Optimization: Introduction and Hill-Climbing03.04.

screen
printer

21Combinatorial Optimization: Advanced Techniques03.04.screen
printer
22

Constraint Satisfaction Problems: Introduction and Examples

05.04.screen
printer
23

Constraint Satisfaction Problems: Constraint Networks

05.04.screen
printer
24Constraint Satisfaction Problems: Backtracking12.04.screen
printer
25Constraint Satisfaction Problems: Arc Consistency12.04.screen
printer
26Constraint Satisfaction Problems: Path Consistency17.04.screen
printer
27Constraint Satisfaction Problems: Constraint Graphs17.04.screen
printer
28Constraint Satisfaction Problems: Decomposition Methods19.04.screen
printer
29Propositional Logic: Basics19.04.screen
printer
30Propositional Logic: Reasoning and Resolution24.04.screen
printer
31Propositional Logic: DPLL Algorithm

26.04.

screen
printer
32Propositional Logic: Local Search and Outlook26.04.screen
printer
33Automated Planning: Introduction03.05.screen
printer
34Automated Planning: Planning Formalisms03.05.screen
printer
35Automated Planning: Delete Relaxation08.05.screen
printer
36Automated Planning: Delete Relaxation Heuristics08.05.screen
printer
37Automated Planning: Abstraction10.05.screen
printer
38Automated Planning: Landmarks10.05.screen
printer
39Automated Planning: The LM-cut Heuristic15.05.screen
printer
40Board Games: Introduction and State of the Art17.05.screen
printer
41Board Games: Minimax Search and Evaluation Functions17.05.screen
printer
42Board Games: Alpha-Beta Search22.05.screen
printer
43Board Games: Stochastic Games22.05.screen
printer
44Board Games: Monte-Carlo Tree Search Framework24.05.screen
printer
45Board Games: Monte-Carlo Tree Search Configurations24.04.screen
printer

Exercises

NoDue DateFiles
126.02.2023Sheet
212.03.2023Sheet 
state-spaces.zip
319.03.2023Sheet
uniform-cost-search.zip
426.03.2023Sheet
502.04.2023Sheet
best-first-search.zip
616.04.2023Sheet
hill-climbing.zip
723.04.2023Sheet
830.04.2023Sheet
907.05.2023Sheet
pddl.zip
1014.05.2023Sheet
1121.05.2023Sheet
1228.05.2023Sheet

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"
20Python implementation of Hill Climbing
21Python implementation of Hill Climbing with Stagnation
21Python implementation of Hill Climbing with Stagnation and Randomization
22Numberphile video on Four Colour Problem
22McGuire et al.: "There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem"
32Bayless et al.: "SAT Modulo Monotonic Theories"
32Katebi et al.: "Empirical Study of the Anatomy of Modern SAT Solvers"
34Sample PDDL files
36Keyder and Geffner: "Heuristics for Planning with Action Costs Revisited"
38Demo of h^MHS computation (requires Gurobi)

 (*) 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.

Social Media

Nach oben