Please enable JavaScript.

Coggle requires JavaScript to display documents.

Pathfinding Algorithms, image, image - Coggle Diagram

- - - - Explores all nodes level by level.
    - - Explores deepest nodes first (LIFO).
    - - Prevents infinite exploration using depth limits.
    - - Expands node with lowest path cost.
    - - Gradually increases depth limit for balanced exploration.
    - - Searches from both start and goal to optimize pathfinding.
  - - - Expands the node closest to the goal based on heuristic.
    - - Optimal and complete search, combines the path cost and heuristic (f(n) = g(n) + h(n)).
    - - Expands nodes based on evaluation functions.