Due

CONTENTS

• Introduction
• Project Instructions
• Tournament play
• What to hand in
• Results of Tournament

     0 1 2 3 4 5 6 7 
  0  B W B W B W B W
  1  W B W B W B W B
  2  B W B W B W B W
  3  W B W B W B W B
  4  B W B W B W B W 
  5  W B W B W B W B
  6  B W B W B W B W        
  7  W B W B W B W B

1. Save konane.py to your own directory. Read through the class definitions.

2. Try executing this file by doing: python konane.py
   This will play one game between a SimplePlayer and a RandomPlayer on a 4 by 4 board.

3. Rather than playing one game at a time, you can play a series of games using the playNGames method. Try playing 10 games between the SimplePlayer and the RandomPlayer on a 8 by 8 board by changing the last two lines in the file to:

   game = Konane(8)
   game.playNGames(10, SimplePlayer(8), RandomPlayer(8), 0)
   

   Notice that the last argument determines whether the moves and the board will be displayed. When this argument is 0, only the final outcome will be shown.

4. Try playing a 6 by 6 game against the RandomPlayer by changing the last two lines in the file to:

   game = Konane(6)
   game.playOneGame(HumanPlayer(), RandomPlayer(6), 1)
   

5. Notice that the Player class is the base class for creating a Konane player. Implement a MinimaxPlayer class that inherits from both the Player class and the Konane class as shown below.

   class MinimaxPlayer(Konane, Player):
   
       def __init__(self, size, depthLimit):
           Konane.__init__(self, size)
           self.limit = depthLimit
   
       def initialize(self, side):
           #complete this
   
       def getMove(self, board):
           #complete this
   

   Notice that the first line of the MinimaxPlayer constructor calls the constructor of the Konane base class. Also notice that the depth limit for the search is passed in as an argument. You should be able to use your MinimaxPlayer in the following way:

   game = Konane(8)
   game.playNGames(2, MinimaxPlayer(8, 2), MinimaxPlayer(8, 1), 0)
   

   Executing the above commands should demonstrate that the minimax player which searches to depth 2 will outperform a minimax player which only searches to depth 1.

   Game 0
   MinimaxDepth2 wins
   Game 1
   MinimaxDepth2 wins
   MinimaxDepth2 2 MinimaxDepth1 0
   

   You should not make any changes to the Konane class. However, because the MinimaxPlayer class inherits from the Konane class, you are welcome to override any of the methods provided in the Konane class.

6. Once you are ready to turn in your solution, change the name of your MinimaxPlayer class so that it begins with a unique team name. Be sure to set the self.name class variable to this new name as well. Email this name to me. I need to know it ahead of time so that I can set up the tournament.