Category: Graphs
Difficulty: advanced
Description: Heuristic pathfinding algorithm
Time Complexity: O(b^d)
Space Complexity: O(b^d)