To overcome the need to backtrack in constraint satisfaction problem c – McqOptions

MCQOPTIONS

1.	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» B. Constraint Propagation

Discussion

No Comment Found

Related MCQs

Language/Languages used for programming Constraint Programming includes ____________
Consider a problem of preparing a schedule for a class of student. What type of problem is this?
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.
To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________