Homework 1

Due February 4th.

• 02: Explain how to convert crytarithmetic puzzles to CSPs. Describe the variables, constraints, and constraint matrices.

  FORTY           29786
  + TEN             850
  + TEN             850
  -----           -----
  SIXTY           31486
  

  Puzzle instructions are on page 65 of the textbook.
• 03: Given the variables $x_1,\ldots, x_5$, how many satisfying assignments does $(x_2+ x_4 + x_1)(x_3 + x_4 +x_2)(x_1 + x_5 + x_4)(x_4 + \overline{x_2} + \overline{x_1})$ have?
• 04: Solve Battleships via SAT (due February 11th).
• 05: Give an admissible heuristic for the word-chain problem. Given a word and the target word, your heuristic should (under)estimate the number of steps in the chain it will take to reach the target using a very fast algorithm. What search behavior does your heuristic encourage?