Questions tagged [bidirectional-search]

For questions about the bidirectional search, which is a search approach where two searches are performed simultaneously, one starting from the start node and the other starting from the goal node, until both meet.

Filter by
Sorted by
Tagged with
2
votes
2answers
532 views

If uniform cost search is used for bidirectional search, is it guaranteed the solution is optimal?

If uniform cost search is used for both the forward and backward search in bidirectional search, is it guaranteed the solution is optimal?
1
vote
1answer
157 views

What is the space complexity of bidirectional search?

Is the space complexity of the bidirectional search, where the breadth-first search is used for both the forward and backward search, $O(b^{d/2})$, where $b$ is the branching factor and $d$ the length ...
5
votes
1answer
1k views

Is the 'direction' considered, when determining the branching factor in bidirectional search?

If I am correct, the branching factor is the maximum number of successors of any node. When I am applying bidirectional search to a transition graph like this one below If 11 is the goal state and I ...