In every article I found it seems to say that only when BFS is used in both directions the bidirectional search is complete. I do not realluy understand that, because there are way more "complete" search algorithms. For example, if one of the directions used IDS(iterative deepening search) or A* path instead of BFS, would it not be complete? So, my main question is what is the basis of the phrase "only when BFS is used in both directions then bidirectional search is complete"? And what are the true criteria of the completeness of a search algorithm like that?
Thanks
I thought about running a bidirectional search graph code in python in order to determine if those would be complete, but I do not know if it will work in every example so it is a little inaccurate to do that.
