Introduction to Search Algorithms
General Information
| Lecturer: | Prof. Dr. Benno Stein |
| Lab advisors: | Michael Völske, Johannes Kiesel |
| Workload: | 4.5 ECTS, 2 SWS Lecture, 1 SWS Lab |
| Lecture: | Th. 9:15am - 10:45am. HK7 |
| Lab: | Th. 11:00am - 12:30pm (biweekly). Marienstr. 13C, lecture hall D |
| Examination: | Th. 19.02.2015, 11:00am, HSC, M13C |
Lecturenotes
Search Algorithms > Introduction > Organization, Literature Search Algorithms > Introduction > Search Problems Search Algorithms > Searchspace Representation > State-Space Representation Search Algorithms > Searchspace Representation > Problem-Reduction Representation Search Algorithms > Basic Search Algorithms > Uninformed Search (1) Search Algorithms > Basic Search Algorithms > Uninformed Search (2) Search Algorithms > Informed Search > BF: Introduction Search Algorithms > Informed Search > BF: Specializations Search Algorithms > Informed Search > BF: Hybrid Strategies Search Algorithms > Search Theory > A*: Formal Properties (1) Search Algorithms > Search Theory > A*: Formal Properties (2) Search Algorithms > Relaxed Models > A*: Relaxing Optimality (1) Search Algorithms > Game Playing > Basic Game Playing Strategies
Labs
The deadline and the exercises to be submitted are on the exercise sheet.
Lab class dates:
- [October 30, 2014]
Lab class introduction [goat-cabbage-wolf example]
Assignment S:II; deadline: Nov. 12 - [November 13, 2014]
Lab class S:II
Assignment S:III; deadline: Nov. 26 - [November 27, 2014]
Lab class S:III
Assignment S:IV; deadline: Dec. 10 - [December 11, 2014]
Lab class S:IV
Assignment S:V; deadline: Jan. 8 - [January 8, 2015]
Lab class S:V [eight-puzzle-astar source and runnable jar]
Assignment S:V-2; deadline: Jan. 21 - [January 22, 2015]
Lab class S:VI
Assignment S:VI; deadline: Feb. 4
Group work up to 3 people is allowed. Please provide both your name(s) and student number(s) with your solutions. To submit your solutions, send an email to Michael Völske with a single PDF file or ZIP archive, and name the file <last name>-<student number>-sa-lab<lab-class-number>.[pdf|zip], e.g. "meier-4711-schulz-1234-sa-lab3.pdf" or "meier-4711-schulz-1234-sa-lab3.zip". If you need to submit source code, include it in the ZIP archive. Thank you!
To be eligible for the exam, you have to present your solution to one of the exercises in a lab class. Eligible students [February 5th, 2015].
Literature
- Edmund K. Burke, Graham Kendall. Search Methodologies. 2nd edition, Springer, 2014.
- Nils J. Nilsson. Artificial Intelligence: A New Synthesis. Morgan Kaufmann, 1998.
- Judea Pearl. Heuristics. Addison-Wesley, 1984.
- Stuart Russel, Peter Norvig. Artificial Intelligence: A Modern Approach. 3rd edition, Prentice Hall, 2010.
The slides of this course follow the book Heuristics of Judea Pearl.