Bidirectional search

Bidirectional Search
Bidirectional Search, as the name implies, searches in two directions at the same time: one forward from the initial state and the other backward from the goal.

Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph.

Bidirectional search
Instead of searching from the start to the finish, you can start two searches in parallelâ€-one from start to finish, and one from finish to start. When they meet, you should have a good path.

Bidirectional search
The idea behind bidirectional search is to simultaneously search both forward from the initial state and backward from the goal, and stop when the two searches meet in the middle .
Comparing search strategies ...

bidirectional search search that is done both from the start toward the goal and from the goal back toward the start, until the fringes of the two searches intersect.

We introduce various flavors of Breadth First Search and Depth First search and then looks at alternatives and improvements that include Iterative Deepening and Bidirectional Search.

See also: Search algorithm, AI, Knowledge, Artificial intelligence, Neural network