Is DIBBS a DXBB algorithm?

The recently-introduced Dynamically Improved Bounds Bidirectional Search (DIBBS) algorithm attributes its success to the fact that it is not a deterministic expansion-based black box algorithm (DXBB). After communication with the authors, there is agreement that this characterization is incorrect. The goal of this research note is to provide correction in the literature regarding the claims around DIBBS, to make it clearer why DIBBS is a DXBB algorithm, and to explain why its performance is bounded by bidirectional search theory.

Authors

• Nathan R. Sturtevant University of Alberta
• Shahaf Shperberg
• Ariel Felner Computer and Information Sciences, Ben-Gurion University of the Negev

Keywords

• Bidirectional
• Heuristic
• Search