Using Heuristic Functions where h(n) = estimated cost of the cheapest path from state at node n to goal state.
#Memory-bounded Search
- A* search uses memory for:
- Frontier
- Reached states
- In general, there are ways to remove nodes from the reached states (depending on the problem)
- Other options:
Inference in CSPs