1. G. Adelson-Velskiy, V. Arlazarov, and M. Donskoy. Some methods of controlling the tree search in chess programs. Artificial Intelligence, 6(4):361–371, 1975.
2. J. Culberson. Sokoban is PSPACE-complete. Technical Report TR97-02, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, 1997. ftp://ftp.cs.ualberta.ca/pub/TechReports/1997/TR97-02 .
3. D. Dor and U. Zwick. SOKOBAN and other motion planning problems, 1995. At: http://www.math.tau.ac.il/~ddorit .
4. M. Ginsberg. Essentials in Artificial Intelligence. Morgan Kaufman Publishers, San Francisco, 1993.
5. G. Goetsch and M.S. Campbell. Experiments with the null-move heuristic. In T.A. Marsland and J. Schaeffer, editors, Computers, Chess, and Cognition, pages 159–181, New York, 1990. Springer-Verlag.