Explanation: Refer definition of backtracking algorithm. 5. To overcome the need to backtrack in constraint satisfaction problem can be eliminated by
A. Forward Searching
B. Constraint Propagation
C. Backtrack after a forward search
D. Omitting the constraints and focusing only on goals
Answer:A
Explanation: Refer definition of backtracking algorithm. 5. To overcome the need to backtrack in constraint satisfaction problem can be eliminated by
A. Forward Searching B. Constraint Propagation C. Backtrack after a forward search D. Omitting the constraints and focusing only on goals
Explanation: Forward Searching is technique in which a forward check till k steps is made to analyze that the goal can be achieved satiating all constraints. With constraint propagation, constraints on a variable can be propagated to next level/hierarchy and satisfied at that level, eliminating need to backtrack.