Bidirectional best-first search would not lead to optimal solution with : g(n) + h(n) Need a new f(n) function It can be more efficient than unidirectional search, but not always It is complete and optimal
BFS