Abstract
In bidirectional search of a state space <240>, search proceeds both backwards and forwards. The program terminates when a common state is reached, since this means that a path has been found from the initial state to the goal state.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Barr, A. and Feigenbaum, E.A. (editors). The Handbook of Artificial Intelligence Vol. 1. Kaufmann, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Bidirectional Search. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive