General-Game-Playing-Using-Monte-Carlo-Tree-Search

Implementation of Monte Carlo Tree Search along with two zero-sum games as it's use case.
Games Implemented

1. Connect4
   
2. Othello/Reversi
   

Monte Carlo Tree Search is a heuristic search algorithm with links to Reinforcement Learning. It consists of four stages

1. Selection
2. Expansion
3. Simulation
4. Backpropagation

Usage

To run Connect4
gcc mc.h monte_carlo_c4.c .\mcts_connect4.c -lm
./a.out

To run Othello/Reversi
gcc header.h .\monte_carlo.c .\myreversi.c -lm
./a.out