Question: 3) Please answer full question (a-c) for thumbs up. You are given a CSP problem and you are interested in finding ALL the possible assignments
3) Please answer full question (a-c) for thumbs up.
You are given a CSP problem and you are interested in finding ALL the possible assignments of values to variables that satisfy the constraints.
a) what algorithm would you use? Please explain.
b) what representation (incremental formulation or complete-state formulation) do you think would work best? why?
c) Would you use the Minimum Remaining Values and degree heuristics? why? or why not?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
