Abstract
Humans can effectively navigate through large search spaces, enabling them to solve problems with daunting complexity. This is largely due to an ability to successfully distinguish between relevant and irrelevant actions (moves). In this paper we present a new single-agent search pruning technique that is based on a move’s influence. The influence measure is a crude form of relevance in that it is used to differentiate between local (relevant) moves and non-local (not relevant) moves, with respect to the sequence of moves leading up to the current state. Our pruning technique uses the m previous moves to decide if a move is relevant in the current context and, if not, to cut it off. This technique results in a large reduction in the search effort required to solve Sokoban problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
D. Dor and U. Zwick. SOKOBAN and other motion planning problems, 1995. At: http://www.math.tau.ac.il/~ddorit.
M. Ginsberg. Essentials in Artificial Intelligence. Morgan Kaufman Publishers, San Francisco, 1993.
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.
A. Junghanns and J. Schaeffer. Single-agent search in the presence of deadlock. In AAAI-98, pages 419–424, Madison/WI, USA, July 1998.
A. Junghanns and J. Schaeffer. Sokoban: Evaluating standard single-agent search techniques in the presence of deadlock. In Advances in Artificial Intelligence, pages 1–15. Springer Verlag, 1998.
R.E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97–109, 1985.
R.E. Korf. Macro-operators: A weak method for learning. Artificial Intelligence, 26(1):35–77, 1985.
R.E. Korf. Finding optimal solutions to Rubik’s Cube using pattern databases. In AAAI-97, pages 700–705, 1997.
J. Schaeffer. Experiments in Search and Knowledge. PhD thesis, Univ. of Waterloo, Canada, 1986.
G. Wilfong. Motion planning in the presence of movable obstacles. In 4th ACM Symposium on Computational Geometry, pages 279–288, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Junghanns, A., Schaeffer, J. (1999). Relevance Cuts: Localizing the Search. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_1
Download citation
DOI: https://doi.org/10.1007/3-540-48957-6_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65766-8
Online ISBN: 978-3-540-48957-3
eBook Packages: Springer Book Archive