Question: 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.
Options
A : TRUE
B : FALSE
C : -
D : -
Click to view Correct Answer
Constraints Satisfaction Problems more questions
Constraint satisfaction problems on finite domains are typically solved using....
Language/Languages used for programming Constraint Programming includes __
Nils Nilsson headed a team at SRI that created a....
Solving a constraint satisfaction problem on a finite domain is....
The new organization established to implement the Fifth Generation Project....
The term ___ is used for a depth-first search that....
To overcome the need to backtrack in constraint satisfaction problem....
What among the following constitutes to the incremental formulation of....
When do we call the states are safely explored?