Shperberg

Over the past few years, there has been a great deal of theoretical and empirical work on both of these algorithms. As part of the research conducted on these algorithms, some interesting theoretical properties were proven for fMM and not for GBFSH and vice versa. In addition, both of them are used as benchmarks for evaluation bidirectional heuristic search algorithms. In this paper we show that fMM infused by a lower-bound propagation and GBFSH are equivalent. In essence, every instance of fMM can be mapped to an instance of GBFSH that expands the exact sequence of nodes and vice versa.