To overcome the need to backtrack in constraint satisfaction problem can be eliminated by __________

A)  Constraint Propagation
B)  Backtrack after a forward search
C)  Local Beam search
D)  Forward Searching

Correct Answer :   Forward Searching


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.