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;
