Explain A* Search Algorithm.

Explain A* Search Algorithm.

Approach: Describe a heuristic-based pathfinding algorithm.

A graph traversal and path search algorithm that is often used in computer science due to its completeness, optimality, and efficiency. it uses a heuristic to estimate the cost from the current node to the goal, guiding the search.

Follow-up: What happens if the heuristic overestimates the cost?

Key concepts: heuristic, f(n) = g(n) + h(n), admissibility.