Iterative deepening A* search (IDA*)

IDA* (Iterative Deepening A*) combines the space efficiency of iterative deepening with the optimality of A*. It performs depth-first search with successively increased cost thresholds.

The algorithm uses an admissible heuristic function to guide the search and guarantees finding the optimal path while using minimal memory.

Bi-directional IDA* runs the search simultaneously from both start and goal nodes, potentially reducing the search space significantly.