Bi-directional search

Many classical search algorithms such as BFS and DFS search from the initial state toward the goal. However, this approach can be inefficient for large search spaces, especially when the branching factor is high or the solution depth is large.

To improve performance, Bidirectional Search was introduced as an effective strategy thatsearches simultaneously from both the initial state and the goal state. The idea is to reduce the search depth and total number of nodes expanded by meeting in the middle.