Ker Wei Khaw
Monte Carlo Tree Search agent in a game of Isolation
Implemented the standard Upper Confidence Bound 1 method of the Monte Carlo Tree Search (MCTS) algorithm to play a game of Isolation between two chess knight pieces. The opponent provided by the coursework runs on the heuristic-driven minimax algorithm. Under a 150 ms per move constraint, the MCTS agent is able to achieve an average win-rate of over 40%.