4. Constraint Satisfaction Problems We are going to consider a simplified version of the sudoku puzzle: D G E 2 F H 4 1 IK 3 L The solution to this problem is to generally assign values between 1 and 4 to each of the letters while satisfying the condition; each number (1-4) must appear exactly once in each row, column, and 2x2 box, without changing the numerals that are already in the grid. (a) What is the size of the state space for this CSP? You do not have to consider constraints. (b) List all unary constraints (c) If we choose to assign the first variable using the minimum remaining values (MRV) heuristic, which vari- able(s) would get chosen? List all such variables if there is a tie. (d) Prior to assigning any variables, use both unary constraints and are consistency due to binary constraints to reduce the domains of the problem. 4. Constraint Satisfaction Problems We are going to consider a simplified version of the sudoku puzzle: D G E 2 F H 4 1 IK 3 L The solution to this problem is to generally assign values between 1 and 4 to each of the letters while satisfying the condition; each number (1-4) must appear exactly once in each row, column, and 2x2 box, without changing the numerals that are already in the grid. (a) What is the size of the state space for this CSP? You do not have to consider constraints. (b) List all unary constraints (c) If we choose to assign the first variable using the minimum remaining values (MRV) heuristic, which vari- able(s) would get chosen? List all such variables if there is a tie. (d) Prior to assigning any variables, use both unary constraints and are consistency due to binary constraints to reduce the domains of the