Iterative Deepening A* (IDA*) (Informed Search Informed Search)
Jump to navigation
Jump to search
Time Complexity
$O(b^d)$
Space Complexity
$O(b^d)$
(Stores all generated nodes in memory)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1985
Reference
https://linkinghub-elsevier-com.ezproxy.canberra.edu.au/retrieve/pii/0004370285900840