Author:
Amos Martyn,Coldridge Jack
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference20 articles.
1. Berger MS, Lawton JH (2007) Multi-agent planning in Sokoban. Multi-agent systems and applications V. Lecture notes in computer science, vol 4696. Springer, pp 334–336
2. Botea A, Müller M, Schaeffer J (2003) Using abstraction for planning in Sokoban. In Schaeffer J, Müller M, Björnsson Y (eds) Computers and Games 2002, number 2883 in Lecture notes in computer science. Springer Verlag, pp 360–375
3. Dechter R, Pearl J (1985) Generalized best-first strategies and the optimality of A*. J ACM 32(3):505–536
4. Demaine ED, Hoffmann M (2001) Pushing blocks is NP-complete for noncrossing solution paths. Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG 2001), Waterloo, Ontario, Canada, 13–15 August 2001, pp 65–68
5. Dor D, Zwick U (1999) SOKOBAN and other motion planning problems. Comput Geom Theory Appl 13(4):215–228
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Generating Entertaining Human-Like Sokoban Initial States;2021 40th International Conference of the Chilean Computer Science Society (SCCC);2021-11-15
2. Modeling of Jigsaw Game Software with a Map Using UML;Proceedings of the 2015 International Conference on Electrical and Information Technologies for Rail Transportation;2016
3. Zen Puzzle Garden is NP-complete;Information Processing Letters;2012-01