Microsoft Word Hws.docx-HWS.pdf Mozilla Firefox Chegg 5tudyl Guided 5 x m Upload Assignment Ho Microsort Word-Hw5.doc x Search ID 4 cf 4 3- CSP PC suppose we have a CSP with 4 variables ?, , X2,Xyx, E (0,1} and 3 factors ti, 1 E {1,2,3). t?, tats are binary XOR functions between Xt, XzX, (f (X)-?, ?,+1, 1 E { 1,2). t3 is a factor among all X,,X2, X^,X: t(X) xVx2Vx Vx, a) Draw the factor graph for this problem. b) How many consistent assignments are there for this CSP? c) If we use backtracking search to solve the CSP without using any heuristics (MCV, LCV, AC-3) or lookahead, how many times wll backtrack() be called to get all consistent assignments if we use the fixed ordering X1,X3,X2,X4? (You should use the Backtrack algorithm from the slides. The initial arguments are x-2, w-1, and the original Domain.) d) If we use ordering X1,X3,X2,X4 and AC-3, how many times will Backtrack be called to get all consistent assignments? Explain why How can we reduce this CSP to one with only unary andfor binary constraints? Explain what auxilary variables we need to introduce, what their domains are, what unary/binary factors you'll add, and why your scheme works. Add a graph if you think that'll better explain your scheme. e) Microsoft Word Hws.docx-HWS.pdf Mozilla Firefox Chegg 5tudyl Guided 5 x m Upload Assignment Ho Microsort Word-Hw5.doc x Search ID 4 cf 4 3- CSP PC suppose we have a CSP with 4 variables ?, , X2,Xyx, E (0,1} and 3 factors ti, 1 E {1,2,3). t?, tats are binary XOR functions between Xt, XzX, (f (X)-?, ?,+1, 1 E { 1,2). t3 is a factor among all X,,X2, X^,X: t(X) xVx2Vx Vx, a) Draw the factor graph for this problem. b) How many consistent assignments are there for this CSP? c) If we use backtracking search to solve the CSP without using any heuristics (MCV, LCV, AC-3) or lookahead, how many times wll backtrack() be called to get all consistent assignments if we use the fixed ordering X1,X3,X2,X4? (You should use the Backtrack algorithm from the slides. The initial arguments are x-2, w-1, and the original Domain.) d) If we use ordering X1,X3,X2,X4 and AC-3, how many times will Backtrack be called to get all consistent assignments? Explain why How can we reduce this CSP to one with only unary andfor binary constraints? Explain what auxilary variables we need to introduce, what their domains are, what unary/binary factors you'll add, and why your scheme works. Add a graph if you think that'll better explain your scheme. e)