Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

9
  • 95
    This might help! ov3y.github.io/2048-AI Commented Mar 12, 2014 at 6:12
  • 6
    @nitish712 by the way, your algorithm is greedy since you have choose the move with large number of merges which quickly lead to local optima Commented Mar 12, 2014 at 12:45
  • 25
    @500-InternalServerError: If I were to implement an AI with alpha-beta game tree pruning, it would be assuming that the new blocks are adversarially placed. It's a worst-case assumption, but might be useful. Commented Mar 14, 2014 at 20:52
  • 9
    A fun distraction when you don't have time to aim for a high score: Try to get the lowest score possible. In theory it's alternating 2s and 4s. Commented Mar 19, 2014 at 0:31
  • 8
    Discussion on this question's legitimacy can be found on meta: meta.stackexchange.com/questions/227266/… Commented Mar 30, 2014 at 20:37