Algorithm

Problem 2: Consider the following constraint graph for a graph coloring problem. The constraints indi- cate that connected nodes cannot have the same color. The domains are shown in the boxes next to each variable node. RG.B 5)RB R,G,B 1. What are the variable domains after a full constraint propagation? 2. Show the sequence of variable assignments during a pure backtracking search (do not assume that the propagation above has been done), assume that the variables are examined in numerical order and the values are assigned in the order shown next to each node. Show assignments by writing the variable number and the values, e.g.. 1R 3. Show the sequence of variable assignments during backtracking with forward cheeking, assume that the variables are examined in numerical order and the values are assigned in the order shown next to each node Show assignments by writing the variable number and the values, e.g. 1R Problem 2: Consider the following constraint graph for a graph coloring problem. The constraints indi- cate that connected nodes cannot have the same color. The domains are shown in the boxes next to each variable node. RG.B 5)RB R,G,B 1. What are the variable domains after a full constraint propagation? 2. Show the sequence of variable assignments during a pure backtracking search (do not assume that the propagation above has been done), assume that the variables are examined in numerical order and the values are assigned in the order shown next to each node. Show assignments by writing the variable number and the values, e.g.. 1R 3. Show the sequence of variable assignments during backtracking with forward cheeking, assume that the variables are examined in numerical order and the values are assigned in the order shown next to each node Show assignments by writing the variable number and the values, e.g. 1R