To be smarter about the way we search, we can instead select nodes for expansion based on some evaluation function . The evaluation function is a cost estimate, and the node with lowest evaluation is preferred.
Uniform Cost Search
Uniform Cost Search
Uniform Cost Search finds the shortest path by expanding nodes from one end to another following a set of rules and calculating the cost estimate at each point:
- it prioritises the lowest total cost
- prioritises goal states
However, this will still end up visiting every single node.
Link to original
Heuristic Search
Heuristic
A heuristic is a rule of thumb that gives us useful information about our distance to the goal state.
Link to original
Greedy Best First Search
A Greedy Best First Search is like Uniform Cost Search but for it includes a heuristic function (which is the estimated cost of the cheapest path from node to the goal) as a component of its evaluation function .
Link to original
