Abstract
If an iterative deepening search (IDS) procedure has the property that solutions at a given iteration are also found at later iterations, it is possible to skip iterations without loss of correctness. We examine the conditions required for skipping to be worthwhile and give an algorithm for dynamically adapting the skipping to the behaviour of the search procedure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sheridan, D. (2003). Dynamic Step Size Adjustment in Iterative Deepening Search. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_120
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_120
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive