|
||||
![]() HW3: ConstraintsOut 10/03, Due 10/10 by 11:59pm ESTProblem 5.3 from the text (second edition). Explain why it is a good heuristic to choose the variable that is most constrained, but the value that is least constrained in CSP search. Problem 5.6 from the text (second edition). Solve the cryptarithmetic problem in Figure 5.2 by hand, using backtracking, forward checking, and the MRV and least-constraining-value heuristics. (The problem is to find an assignment of digits to letters that makes TWO + TWO = FOUR true). Problem 5.8 from the text (second edition). Use the AC-3
algorithm to show that arc consistency is able to detect the
inconsistency of the partial assignment {WA = red, V = blue} for the
problem shown in figure 5.1 The figure is included below for
reference.
|