2. Reversi game

Rules: https://en.wikipedia.org/wiki/Reversi

Your task is to download the ZIP file and alter the downloaded player.py file for the Reversi game and then play a Reversi tournament against the players of the rest of the class.

This task will teach you about:

• Adversarial search
  • Combinatorial explosion
  • Search algorithm effectivity

The solution can be generalized to other classical games, although in some cases this strategy does not lead to optimal solutions and you would use different approaches (e.g.: Go).

You can find the codes in the student repository KUI Reversi:

1. Create a working directory on your disk, e.g., kui-reversi.
2. You can get the codes into it in two ways:
   • Using git: Clone the kui-reversi repository:

     cd kui-reversi
     git clone https://gitlab.fel.cvut.cz/kui-student-materials/kui-reversi.git .

     Don't forget the . at the end of the previous example: the dot tells git to clone the contents of the repository into the current working directory.
   • Using a ZIP archive:
     1. Download the codes from the KUI Reversi repository as a ZIP file (or directly download kui-reversi-master.zip).
     2. Inside the downloaded archive, you will find the folder kui-reversi-master. Extract its contents into the kui-reversi folder. (You should not see a subdirectory kui-reversi-master inside the kui-reversi folder.)

In the supporting codes, you will find:

• player.py - a module with a template for your player, and also
• graphical (reversi_creator.py) and terminal (headless_reversi_creator.py) environments allowing you to run and play the game.

The file player.py contains the MyPlayer class with a few methods. You can use the method that is already implemented in the MPlayer class called get_all_valid_moves in order to get all the valid moves and thus focus only on your strategy and decision how to play the game.

• docstring should be informative enough
• attribute name contains the username of the student

Example of MyPlayer implementation

class MyPlayer:
    '''super-smart indeed'''
    def __init__(self, my_color,opponent_color):
        self.name = 'username' #username of the student
 
    def select_move(self,board):
        return (0, 0) 

Late submissions do not take part in the tournament and receive 0 points.

Points are given in the following way:

1. The player must work and generate correct moves (e.g.: not outside the board).
2. Manual evaluation is done by the teachers with regards to your code quality.
3. The automatic evaluation gives points based on automatic code testing and the rank of the player in the tournament.

Upload a ZIP archive with the module player.py and any other possible modules you created to the Upload system. All the files must be in the archive's root folder! The archive cannot contain any other folders!

Information about the tournament:

• you play against all the other players on boards of the size $n\times n$, $n \in \{6,8,10\}$ in three separate subtournaments
• every match consists of two games - first, player “A” starts, then player “B” starts
• there are 2 points for winning the match, 1 for a draw, 0 for losing both games
• 5 seconds limit per move - try it out in Brute
• illegal moves results in losing a game
• exceeding the time limit means losing the game
• creating the player (constructor) takes at most 60s
• don't use multithreading

TBA