The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
A. Forward search
B. Backtrack search
C. Hill algorithm
D. Reverse-Down-Hill search
Answer:A
The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.
A. Forward search B. Backtrack search C. Hill algorithm D. Reverse-Down-Hill search
Explanation: Refer definition of backtracking algorithm. 5. To overcome the need to backtrack in constraint satisfaction problem can be eliminated by