1. OTHELLO GAME
• Original Othello/two players / 8 by 8
board.
• The players take turns. All the opponent's
disks lying between new disks and
existing player's disks are flipping.
• Available only moves which opponent's
disks flipping. In case there are haven't
available moves turn next.
• The player with the most number of discs
on the board at the end of the game
wins.
2. My challenges and features
• Unlike a original game, you can choose any dimension of the
game board;
• Each cell is described by a data structure, so board it’s a array
of structure.
• Dynamic memory allocation
• To avoid using global variables;
• Pointer to arrays and variables
• The first variant - console mode;
• 38 different functions and about 1600 lines of code.
• For implement computer moves logics, was used Minimax
algorithm.
3. Minimax
• To find the optimal move for a
player, suppose that your
opponent also plays optimally.
• For each possible action of the
player (A), we check all
possible actions of the other
players (B) and found the best
possible move – the one that
gives player B the biggest
score.
• Then we check which move of
player A will give the smallest
opportunity to player B
