Implement three search algorithms in this homework and simulate several battles by applying the algorithms below as two players.
- Greedy Best-first Search
- Minimax
- Alpha-Beta Pruning
Use backward-chaining algorithm to solve First Order Logic Inference.
- Given a Bayesian network, use variable elimination or enumeration to calculate specific joint probabilities.
- Calculate the expected utility or maximum expected utility, when there are one or more unset decision nodes.