
 CS 4804 Homework #2 
  Pose the magic square puzzle as a boolean satisfiability (SAT) problem in CNF form, i.e., the boolean expression must be a conjunction of disjunctions of propositional variables. 
  Pose this puzzle as a boolean satisfiability (SAT) problem in CNF form, i.e., the boolean expression must be a conjunction of disjunctions of propositional variables. 
  You are not going to solve it as a SAT problem (although that is how you posed it in the previous question); instead, you are going to think of it as a traditional CSP (domains, variables, constraints, representable as a constraint graph) and use traditional CSP techniques (e.g., backtracking, maintaining arcconsistency etc.). 
 courses.cs.vt.edu /~cs4804/Fall03/assignments/two.html (720 words) 
