2048 is (PSPACE) Hard, but Sometimes Easy

@article{Mehta20142048I,
  title={2048 is (PSPACE) Hard, but Sometimes Easy},
  author={Rahul Mehta},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2014},
  volume={21},
  pages={116}
}
  • Rahul Mehta
  • Published in Electronic Colloquium on Computational Complexity 2014
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
Tweets
This paper has been referenced on Twitter 1 time. VIEW TWEETS

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 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

Savitch , Relationships between nondeterministic and deterministic tape complexities

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

Similar Papers

Loading similar papers…