This project was an academic paper on comparing three common search algorithms to solve the 2048 Game. The algorithms used were minimax, Expectiminimax, and Monte Carlo Tree Search. The project is a fork of an existing 2048 AI solver, with some modifications to the code to allow for the implementation of the three algorithms. Then a C script was used to run the experiment in parallel to compare the algorithms. The results of the experiment were then analyzed and discussed in the paper. All the data analysis was done in R.