Informed Methods
Algorithm A
Use as an evaluation function f(n) = g(n) + h(n),
where g(n) is as defined in Uniform-Cost search. That is, g(n) =
minimal cost path from the start state to the current state n.
- Adds a "breadth-first" component to the evaluation function
by including the g term
- Ranks nodes on the search frontier by the estimated cost of
a solution that goes from the start node through the given node to
a goal node. That is, g(n) is the cost from the start node
to node n, and h(n) is the estimated cost from node
n to a goal.
- Not complete since if a node n is on the solution path
but h(n) = infinity, then node n may never be expanded
- Not admissible