Please Help,
Consider a state space where the start state is number 1 and each state k has two successors: numbers 2k and 2k + 1.
1) How well would bidirectional search work on this problem? What is the branching factor in each direction of the bidirectional search?
2) Does the answer to (1) suggest a reformulation of the problem that would allow you to solve the problem of getting from state 1 to a given goal state with almost no search?