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
Dheeraj Gharde
Dheeraj Gharde
MS CS - USC

My interests include fullstack development and software infrastructure engineering.