The search strategy explores nodes from the initial state as well as the goal state is bidirectional search.
What is the bidirectional search?
This is known to be a type of search that is used when the initial and goal states are found in a problem.
Here, we often search forward and also backwards from the first state and the goal state, we often Stop when they meet the middle and it tend to be faster than unidirectional search.
Learn more about search strategy from
https://brainly.com/question/10055344
