State space versus the search tree, problem formulation; uninformed vs. informed search; methods and examples
Main Content
Acquisition
1Lecture content
Content:
– State space versus the search tree;
– Problem formulation;
– Uninformed versus informed search;
– Comparison criteria (completeness, optimality, time and space complexity);
– Search problem examples;
– Optionally the basics of constraint programming;
2h 0min
Practice
2Colab Notebooks
A set of colab notebooks, regarding especially these topics:
– Examples using model problems;
– 8-puzzle, maze, …
– Implementation and comparison of different search methods;
– BFS, UCS, DFS, DLS, IDS, BS, backtracking, FCh, …
– ...
3h 0min
0
Investigation
3Independent study time + review
The estimated additional time required for studying the material independently, using the lecture videos/slides and also referencing other literature and material, as necessary. Facilitates correct understanding of the material.
This activity also includes the time required for review before exams.
5h 30min
Assessment
4Quiz activities
Quiz activities meant to provide quick, unassessed feedback to students regarding their grasp of the material.