خوارزمية *A

A* Algorithms :

        A* Search is One of the most famous search algorithms used in Al, which combines the greedy search algorithm for efficiency with the uniform cost search for optimality and completeness. In A* the evaluation function is computed by the two heuristic measures; the h(n) cost estimate of traversing from n to the goal state g(n) which is the known path cost from the start node to n into a function called f(n) This combination of strategies turns out to provide A* with both completeness and optimality