Analysis of the Game "2048" and its Generalization in Higher Dimensions

We theoretically analyze the popular mobile app game `2048' for the first time in $n$-dimensional space. We show that one can reach the maximum value $2^{n1n2+1}$ and $2^{{\left({\prod_{i=1}{d}} ni}\right)+1}$ for the two dimensional $n1\times n2$ board and $d$ dimensional $n1\times n2\times \ldots \times nd$ board respectively. We also present a strategy for the computer and a winning strategy for the human player in certain conditions.