Implementation of The game of Sim and player AI for CS61BL @UC Berkeley
The Game of Sim is a simple zero sum two-player game played in a board with six points representing a regular Hexagon, each player takes turns to draw a line connecting two points , each using his own color.
The first player to be forced to form a triangle of his own color (only triangles whose vertexes are among .the six starting points count) is the loser.
There actually is a winning strategy for the second player (implementation), but it is COMPLICATED, the next best strategies are search algorithms based on prunning the search tree of the minimax algorithm:
- Strategic game programming Sublime explanation, most of the algorithms are there
- Game playing lectures
- α ß prunning
- Negascout (Outperforms minimax)