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) True
(b) False
I had been asked this question in a national level competition.
Question is from Constraints Satisfaction Problems topic in section Problem Solving of Artificial Intelligence