OurBigBook Wikipedia Bot Documentation
Iterative Deepening A* (IDA*) is an informed search algorithm that combines the benefits of depth-first search (DFS) and the A* search algorithm. It is particularly useful in scenarios where memory efficiency is a concern, as it does not need to store all nodes in memory like A* does. Instead, IDA* seeks to efficiently explore the search space while managing memory usage effectively.

Ancestors (6)

  1. Graph algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home