Chapter 5.2

Searching for Solutions

• Any search technique can work theoretically.
• Breadth-First Search is inefficient! Consider n choices for each variable and a solution of depth d. O(n! * d).
• Breadth-First Search does not take advantage of commutativity.
• Backtracking. Figures 5.3, 5.4, 5.5.
• Minimum Remaining Values (MRV) heuristic.
• Forward Checking heuristic. Figure 5.6.
• Minimum Conflicts heuristic. Figures 5.8, 5.9.

Exercises

5.3, 5.4, 5.11, 5.13