For my project I wanted to see how well Monte Carlo Tree Search was able to solve a board game. I decided to use the game of go as the board game of choice as it has a large search space as well as it is easy to switch to boards of different sizes. This makes it good to be able to compare against an algorithm such as alpha beta minimax as minimax can have trouble in a large search. Also,as I am able to change the board size, I am able to compare the algorithm against Minimax in a setting where Minimax is able to search most or all of the search space. If I instead tried to use a game like chess for studying the differences between the two algorithms, it might be harder to get a clear difference between the two as it is a lot easier for an algorithm like MiniMax to be able to go through a lot of chess games compared to Go.