Time complexity of iterative-deepening-A*

Artificial Intelligence

Volumn 129, Issue 1-2, 2001, Pages 199-218

  Korf, Richard E ^a   Reid, Michael ^b   Edelkamp, Stefan ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Branching factor; Eight Puzzle; Fifteen Puzzle; Heuristic branching factor; Heuristic search; Iterative deepening A*; Problem solving; Rubik's Cube; Sliding tile puzzles; Time complexity

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

HEURISTIC BRANCHING FACTORS; SLIDING-TILE PUZZLES;

ARTIFICIAL INTELLIGENCE;

EID: 0035368447     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00094-7     Document Type: Article

References (10)

1. Pattern databases
2. The branching factor of regular search spaces
3. A formal basis for the heuristic determination of minimum cost paths
4. Depth-first iterative-deepening: An optimal admissible tree search
5. Finding optimal solutions to Rubik's Cube using pattern databases
6. Complexity analysis of admissible heuristic search
7. Disjoint pattern database heuristics
8. Practical and theoretical considerations in heuristic search algorithms