CSSE 413: Alpha Beta Pruning

Problem

Work on this assignment by yourself. The following specifications are added to this more complex version of "Capture the Flag":

• Adversary?? How do you win???
• One or more persons may be on your team.
• No two persons on your team may occupy the same space.
• Zero or more persons may move per turn. Two players may switch positions.
• There may be more flags than players.

The specifications for your software are as follows:

• Use a knowledge representation formalism to represent board states.
• Formulate and implement rules of inference that are used to determine moves.

In addition to turning in your software, we ask you to turn in a document in which you describe your knowledge representation formalism and the rules that you implemented. We ask you to modify your code so that it plays against an adversary that we provide. You must implement Alpha-Beta pruning of MinMax search with a cut-off of your choosing. In general, the deeper you search in the game state space, the more informed your moves will be. However, a deeper cut-off also means more states to be evaluated.

You will be asked to make your move within a time frame to be determined, right now, we are considering a 1 second time frame.

There are no additional requirements posed on the game. You should be able to use the heuristic you developed for the prior programming assignment.

Please monitor the newsgroup closely for important announcements and specifications that may change or be added.

Turnin

• Submit your code to the appropriate drop box on Angel by midnight on Day 16.