Solving 2048-a detailed comparison of strategies

2048 is a mathematical puzzle game which although looks relatively simple with primitive and easy to understand rules. It has been proved that 2048 is Pspace Hard and also computationally np-hard in determining the end tile from a given starting position. Although there have been several attempts in solving 2048 using machine learning algorithms , none of them are easily human understand- able and some of them are also compromised in their consistency. We have thus created our own algorithm that is easier to understand and comprehend by human players. We have also performed a detailed comparison in the pattern strategies explored by most human players.We have concluded on the impor- tance of flexibility in solving the mathematical game. These strategies could be combined in further research to solve the np-hard game.