Abstract
This paper begins by showing that Burch and Holte’s move pruning method is, in general, not safe to use in conjunction with the kind of duplicate detection done by standard heuristic search algorithms such as A*. It then investigates the interactions between move pruning and duplicate detection with the aim of elucidating conditions under which it is safe to use both techniques together. Conditions are derived under which simple interactions cannot possibly occur and it is shown that these conditions hold in many of the state spaces commonly used as research testbeds. Unfortunately, these conditions do not preclude more complex interactions from occurring. The paper then proves two conditions that must hold whenever move pruning is not safe to use with duplicate detection and discusses circumstances in which each of these conditions might not hold, i.e. circumstances in which it would be safe to use move pruning in conjunction with duplicate detection.
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
Burch, N., Holte, R.C.: Automatic move pruning revisted. In: Proceedings of the 5th Symposium on Combinatorial Search, SoCS (2012)
Burch, N., Holte, R.C.: Automatic move pruning in general single-player games. In: Proceedings of the 4th Symposium on Combinatorial Search, SoCS (2011)
Taylor, L.A.: Pruning duplicate nodes in depth-first search. Technical Report CSD-920049, UCLA Computer Science Department (1992)
Taylor, L.A., Korf, R.E.: Pruning duplicate nodes in depth-first search. In: AAAI, pp. 756–761 (1993)
Reinefeld, A., Marsland, T.A.: Enhanced iterative-deepening search. IEEE Trans. Pattern Anal. Mach. Intell. 16(7), 701–710 (1994)
Korf, R.E.: Finding optimal solutions to Rubik’s Cube using pattern databases. In: AAAI, pp. 700–705 (1997)
Helmert, M., Lasinger, H.: The scanalyzer domain: Greenhouse logistics as a planning problem. In: ICAPS, pp. 234–237 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holte, R.C. (2013). Move Pruning and Duplicate Detection. In: Zaïane, O.R., Zilles, S. (eds) Advances in Artificial Intelligence. Canadian AI 2013. Lecture Notes in Computer Science(), vol 7884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38457-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-38457-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38456-1
Online ISBN: 978-3-642-38457-8
eBook Packages: Computer ScienceComputer Science (R0)