## Problem Set 2

Assigned: Feb. 9.

Due: Mar. 2.
### Problem 1

Show the results of applying alpha-beta pruning to the following game
tree. What is the best move for MAX at the top level? (You may do the problem
on this sheet.)

### Problem 2

Convert the following sentences in the propositional logic to clausal form.
(B^C) => A
D => B^C
E <=> (~A V ~D)
(E ^ ~C) => (D^F).

### Problem 3

Trace the action of
the Davis-Putnam algorithm applied to the clauses in problem 2. Assume that,
when the algorithm encounters a branch point, it selects the first atom
in alphabetical order, and that it tries "TRUE" before "FALSE".