Iterative Deepening Dynamically Improved Bounds Bidirectional Search

DOI10.1287/ijoc.2021.1116OpenAlexW3217588637MaRDI QIDQ5086001

Edward C. Sewell, Jacobson, Sheldon H., John A. Pavlik

Publication date: 30 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1116

zbMATH Keywords

Rubik's cubepancakeconsistent heuristicbidirectional heuristic searchsliding tile

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
• Bounds for sorting by prefix reversal
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• Dynamically improved bounds bidirectional search
• Heuristic search viewed as path finding in a graph
• Bidirectional Heuristic Search Again
• An Improved Bidirectional Heuristic Search Algorithm
• Finding the Shortest Route between Two Points in a Network
• The Diameter of the Rubik's Cube Group Is Twenty

This page was built for publication: Iterative Deepening Dynamically Improved Bounds Bidirectional Search