Description

2. The missionaries and cannibals problem (see the lecture notes): Consider the case of M = 5 and K = 3. Use the heuristic function h(n) = M + C − 2B. Trace the operation of A∗ with cycle checking: Draw the search tree; for each node, mark its g and h values.
3. Perform alpha beta pruning on the following game tree and compute the utility value of the root.

1