CS 188, Fall 2005, Introduction to Artificial Intelligence
Assignment 6 Part 2, due 12/16, total value up to 5% extra credit
This portion of A6 is optional and for extra credit only.
The goal is to develop the best Spider program you can.
Pursue some or all of the following ideas:
- Make sampling-expectimax a graph search algorithm instead of a tree
search algorithm, to get deeper lookahead.
- Add a depth penalty at each stochastic multiple-outcome branch.
- Add new features and/or modify weights based on detailed
observation of the agent's behaviour.
- Try a simple policy search method using agent-trial to evaluate
various weight modifications.