The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure.

A. Heuristic B. Critical C. Value based D. Analytical E. None of the above

A. Design B. Distribution C. project management D. field service E. None of the above

A. hierarchical planning B. non-hierarchical planning C. All of the above D. project planning E. None of the above

A. The Turing Test B. LISP C. The Logic Theorist D. Cybernetics E. None of the above