A Search

A Search* computes a cost function $f(n)=g(n)+h(n)$, where:

• $g(n)$ is the cost from the initial state to $n$
• $h(n)$ is the estimated distance of $n$ from the goal state

We choose the state with the lowest value of $f(n)$ when expanding nodes.