Need help with 2048_M-A-Star?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

205 Stars 28 Forks Apache License 2.0 20 Commits 1 Opened issues


2048 solver

Services available


Need anything else?

Contributors list

No Data


This project provides an algorithm to solve the popular game 2048:

The idea is based on the A* search algorithm. There are implemented 3 cost functions:

  1. sum of all tiles in the playing field
  2. number of all unassigned tiles in the playing field
  3. average value of an occupied tile

Up to now the third cost function seems to be most promising.

By increasing the depth (level) of the A* search tree the classification can be improved, but it needs much more time, too.

I have found a bug which made the game simpler than the real game. So it will take more time to make the algorithm smarter.

To check the result of my algorithm you can run which solves a random sample game.

You can also play the game by running

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.