Abstract
Searches of one form or another are a central unifying theme in Artificial Intelligence and effective management of symmetry is a key practical consideration in the practical application of a huge range of search techniques. It is almost never desirable to search, but frequently hard to avoid searching, very large numbers of equivalent sections of the search tree. Likewise many searches, if symmetry is not accounted for, will return very large numbers of unwanted equivalent solutions.
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
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Linton, S. (2008). Symmetry and Search – A Survey. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds) Intelligent Computer Mathematics. CICM 2008. Lecture Notes in Computer Science(), vol 5144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85110-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-85110-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85109-7
Online ISBN: 978-3-540-85110-3
eBook Packages: Computer ScienceComputer Science (R0)