aliases: - A* Search - A*Copy
aliases: - A* Search - A*
Combines Uniform Cost Search and Greedy Search.
If path_cost = and heuristic function =
path_cost
heuristic function
Can prove that A is Complete and optimal*, but only if is admissible (meaning it underestimates the true path cost from state to solution) Very memory intensive as you have to record all states