final-csps

(c) How many edges are there in the constraint graph for this CSP? (d) The table below shows the variable domains after all unary constraints have been enforced. A 2 3 4 5 6 B 2 3 6 F 1 3 5 J 1 2 3 4 T 1 2 3 4 5 Following the MRV heuristic, which variable should we assign first? Break all ties alphabetically. *$ A *$ B *$ F *$ J *$ T (e) To decouple this from the previous question, assume that we choose to assign (F)araz first. In this question, we will choose which value to assign to using the Least Constraining Value method. To determine the number of remaining values, enforce arc consistency to prune the domains. Then, count the total number of possible assignments ( not the total number of remaining values). It may help you to enforce arc consistency twice, once before assigning values to (F)araz, and then again after assigning a value. (i) Assigning F = results in possible assignments. (ii) Assigning F = results in possible assignments. (iii) Assigning F = results in possible assignments. (iv) Using the LCV method, which value should we assign to F? If there is a tie, choose the lower number. *$ 1 *$ 2 *$ 3 *$ 4 *$ 5 *$ 6 Extra tables for work: A 2 3 4 5 6 B 2 3 6 F 1 3 5 J 1 2 3 4 T 1 2 3 4 5 A 2 3 4 5 6 B 2 3 6 F 1 3 5 J 1 2 3 4 T 1 2 3 4 5 A 2 3 4 5 6 B 2 3 6 F 1 3 5 J 1 2 3 4 T 1 2 3 4 5 A 2 3 4 5 6 B 2 3 6 F 1 3 5 J 1 2 3 4 T 1 2 3 4 5 3