a* search

what is A* search

• Uniform-cost orders by path cost, or backward cost g(n)
• Greedy orders by goal proximity, or forward cost h(n)
• combination of UCS and greedy → Orders by the sum of backward cost ( g(n) ) and forward cost ( h(n) ): $$\begin{gathered} (f(n)=g(n)+h(n) \\ ) \end{gathered}$$ → A*