Bidirectional Search

#uninformed

• Search from both sides of a search space and hope to meet in the middle.
• Only have to go half depth (could be paralelized?)

Difficulties:

Do you really know the solution?
Must be able to reverse operators
Record all paths to check if they meet - Memory Intensive