Using Heuristics
Take the Manhattan distance as an example
In Best first, order all states in list by Manhattan
In Depth first, order only new states by Manhattan
- still hope to explore most promising first
In Breadth first, similarly
Heuristics important to all search algorithms
- Almost all problems solved by search solved by good heuristics
- Excepting small problems like 8’s puzzle