Bidirectional search that is guaranteed to meet in the middle Conference Paper uri icon


  • Abstract We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to “meet in the middle”, ie never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A*, and brute- force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical analysis.

publication date

  • January 1, 2016