A* Search

خوارزمية البحث A*

Definition

A shortest-path search algorithm that adds the cost of the path travelled so far to a heuristic estimate of the remaining cost.

Definition

A* finds least-cost paths by expanding nodes that minimise cost-so-far plus a heuristic estimate to the goal; with an admissible heuristic it is optimal.

Mathematical equations

f(n)=g(n)+h(n)

Learn and review

Suggested terms to learn next