5: Smart Search using Constraints
Slides
Contents
- The definition of Constraint Satisfaction Problems (CSP).
- The presentation of the Backtracking search algorithm.
- A discussion on how we can improve the efficiency of the backtracking algorithm for solving CSPs.
Required Reading
R&N Sections 6.1–6.3 or NIE Chapter (7) "Constraint Satisfaction Problems", Sections 1–3.
NOTE: The abbreviation R&N refers to :
“Artificial Intelligence: A Modern Approach” Third Edition, Russell R & Norvig P, Prentice Hall, 2010 (R&N).
The abbreviation NIE stands for the following edition of the same book:
“Artificial Intelligence: A Modern Approach” Third Edition, Pearson New International Edition, Russell R & Norvig P, Pearson, 2014.
Quiz: Smart Searching Using Constraints
These questions are designed to test your understanding of the course content in Lecture 5; doing this quiz does not contribute to your overall grade, but we can give some formative feedback. This quiz requires that you have gone through Lecture 5 and done the required reading. The questions require a short text answer. You can ask for formative feedback from your tutor or on piazza.