Frontier search

DOI10.1145/1089023.1089024zbMath1323.68466OpenAlexW2293358747MaRDI QIDQ3546304

Heath Hohwald, Richard E. Korf, Ignacio Thayer, Weixiong Zhang

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1089023.1089024

zbMATH Keywords

heuristic searchsliding-tile puzzlessequence alignmentDijkstra's algorithmbreadth-first searchbidirectional searchbest-first searchTowers of Hanoi\(A^\ast\) algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Weighted \(A^*\) search - unifying view and application ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Sorting with forbidden intermediates ⋮ Inconsistent heuristics in theory and practice ⋮ Decision making with multiple objectives using GAI networks ⋮ Breadth-first heuristic search ⋮ Iterative-deepening search with on-line tree size prediction ⋮ Survey on Directed Model Checking ⋮ Hierarchical Adaptive State Space Caching Based on Level Sampling

This page was built for publication: Frontier search