Dynamically improved bounds bidirectional search

E. C. Sewell, S. H. Jacobson

Research output: Contribution to journalArticlepeer-review


This paper presents a bidirectional search algorithm that dynamically improves the bounds during its execution. It has the property that it always terminates on or before the forward search meets the backward search. Computational experiments on the pancake problem, the sliding tile puzzle, and the topspin problem demonstrate that it is capable of solving problems using significantly fewer node expansions than A or state-of-the-art bidirectional algorithms such as MMϵ and GBFHS.

Original languageEnglish (US)
Article number103405
JournalArtificial Intelligence
StatePublished - Feb 2021
Externally publishedYes


  • Bidirectional search
  • Heuristic search

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence


Dive into the research topics of 'Dynamically improved bounds bidirectional search'. Together they form a unique fingerprint.

Cite this