top of page
Othello Board
We built a GUI for this project, and these are the starting positions for each player.
Minimax Function
The minimax function recursively analyzes each node in the tree of all possible moves in the next N turns and returns the best move to pursue.
OTHELLO AI
Skills | Python
Team Size | 3
The strategy board game Othello pits two players against each other to capture as many pieces on the board as possible, and in most cases, the players must think many turns in advance. Using Python, I coded and tested the minimax algorithm, which is a recursive function that determines the best move that will both maximize the AI's own points and minimize it's opponent's. The program was able to run reasonably fast when looking at all possibilities of the next 7 turns.
Links:
bottom of page