The idea behind bidirectional search is to run two simultaneous searches – one forward from the the initial state and the other backward from the goal, stopping when the two searches meet in the middle (figure (12)). The motivation is that $b^{d/2}$ is much less than $b^d$, or in the …