Time complexity of iterative-deepening-\(A^{*}\)
From MaRDI portal
Publication:5941316
DOI10.1016/S0004-3702(01)00094-7zbMath0971.68147MaRDI QIDQ5941316
No author found.
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
problem solvingtime complexityheuristic searchbranching factoreight puzzlefifteen puzzleheuristic branching factoriterative-deepening-ARubik's Cubesliding-tile puzzles
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (13)
Duality in permutation state spaces and the dual search algorithm ⋮ HEURISTIC SEARCH UNDER CONTRACT ⋮ Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Inconsistent heuristics in theory and practice ⋮ Heuristic Hill-Climbing as a Markov Process ⋮ Maximizing over multiple pattern databases speeds up heuristic search ⋮ Iterative-deepening search with on-line tree size prediction ⋮ Predicting optimal solution cost with conditional probabilities ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Disjoint pattern database heuristics ⋮ Probably bounded suboptimal heuristic search ⋮ Heuristics as Markov chains ⋮ Average-case analysis of best-first search in two representative directed acyclic graphs
Cites Work
This page was built for publication: Time complexity of iterative-deepening-\(A^{*}\)
