53.
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.

54.
Decision trees are appropriate for the problems where ___________

60.
Where does the dependance of experience is reflected in prior probability sentences?