Bidirectional
Search Discussion
nNumerical Example (b=10, l = 5)
nBi-directional search finds solution at
d=3 for both forward
and backward search. Assuming BFS in
each half
2222 nodes are expanded.
nImplementation issues:
nOperators are reversible, e.g., Pred(Succ(n)) =
Pred(Succ(n))
nThere may be many possible goal states.
nConstruct a goal state containing the superset of
all goal states.
nCheck if a node appears in the “other”
search tree.
nUsing different search strategies for each half.