Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. http://home.comcast.net/~jpittman2/pacman/pacmandossier.html
2. Cormode, G.: The hardness of the Lemmings game, or Oh no, more NP-completeness proofs. In: Proceedings of FUN 2004, pp. 65–76 (2004)
3. Demaine, E.D., Hearn, R.A.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Albert, M.H., Nowakowski, R.J. (eds.) Games of No Chance 3, vol. 56, pp. 3–56. MSRI Publications (2009)
4. Forišek, M.: Computational complexity of two-dimensional platform games. In: Proceedings of FUN 2010, pp. 214–226 (2010)
5. Friedman, E.: Pushing blocks in gravity is NP-hard (2002) (manuscript),
http://www2.stetson.edu/~efriedma/papers/gravity.pdf
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reinforcement Learning Pathfinding Algorithm Based on Fusion Information;2024 International Conference on Intelligent Computing and Robotics (ICICR);2024-04-12
2. Bust-a-Move/Puzzle Bobble Is NP-complete;Lecture Notes in Computer Science;2016
3. Classic Nintendo Games Are (Computationally) Hard;Lecture Notes in Computer Science;2014
4. Lemmings Is PSPACE-Complete;Lecture Notes in Computer Science;2014
5. Gaming Is a Hard Job, but Someone Has to Do It!;Theory of Computing Systems;2013-08-31