• In this lab, we will develop computational strategies for the Iterated Prisoner's Dilemma.
• Download the provided implementation.
  • Create an Eclipse project from the unzipped files.
• To create a strategy, create a class that implements the Strategy interface, and place it in the strategies package. Three simple examples have been provided.
• To run a simulation with your strategies, execute the Simulator class.
• Your grade will depend upon the total number of strategies you create, subject to the following constraints:
  • No strategy may duplicate the behavior of any of the three provided strategies.
  • Every strategy must use some persistent state.
  • Each strategy should be named after the author. For example, a student named John Smith would create JohnSmith1.java, JohnSmith2.java, and so forth.
  • To earn an "A", at least one strategy must use an array.
• Submit all of your strategy files via Moodle by Tuesday, February 3 at 9:45 AM.
• We will run a simulation during class that day.
  • The authors of the top ten winning programs will receive a grade of A+.
  • The instructor reserves the right to also award an A+ to any strategy he considers particularly interesting or creative.

Grading