2048 is (PSPACE) Hard, but Sometimes Easy

  title={2048 is (PSPACE) Hard, but Sometimes Easy},
  author={Rahul Mehta},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  • Rahul Mehta
  • Published 2014 in Electronic Colloquium on Computational Complexity
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness result holds for a version of the problem where the player has oracle access to the computer player’s moves. Specifically, we show that for an n × n game board G, computing a sequence of moves to reach a particular configuration C from an initial configuration C0 is PSPACE-Complete. Our reduction is from Nondeterministic Constraint Logic (NCL). We also show that determining whether or not there… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
1 Citations
8 References
Similar Papers


Publications referenced by this paper.
Showing 1-8 of 8 references

Demaine , Pspacecompleteness of slidingblock puzzles and other problems through the nondeterministic constraint logic model of computation

  • Robert A. Hearn, D. Erik
  • Theor . Comput . Sci .
  • 2005


  • Michael R. Garey
  • 2002

, and Robin Thomas , The four - colour theorem

  • Neil Robertson, Daniel P. Sanders, Paul D. Seymour
  • J . Comb . Theory , Ser . B
  • 1997

Savitch , Relationships between nondeterministic and deterministic tape complexities

  • J Walter
  • J . Comput . Syst . Sci .
  • 1970

Similar Papers

Loading similar papers…