Informed Search Strategies Informed search strategies are a class of search algorithms that utilize additional knowledge or information about the search spa...
Informed Search Strategies
Informed search strategies are a class of search algorithms that utilize additional knowledge or information about the search space to guide the search process. These strategies leverage auxiliary data sources, such as domain knowledge, statistics, or past search experiences, to refine the search path and improve the efficiency of the search.
Greedy Search
Greedy search is an informed search strategy that follows a simple and local search pattern. It maintains a candidate solution and explores the neighborhood of the current solution in a systematic fashion. The algorithm continues the search until it finds a solution that meets the specified criteria or reaches a dead end.
A Search*
A search* is a dynamic programming-based search algorithm that utilizes a heuristic function to guide the search. The heuristic function estimates the remaining cost to the target solution from the current node. A* maintains a priority queue that stores nodes with the lowest estimated cost, enabling the algorithm to explore nodes with higher estimated costs but lower estimated distances.
Key Differences between Greedy and A Search*
| Feature | Greedy Search | A* Search |
|---|---|---|
| Search pattern | Local search | Dynamic programming |
| Heuristic function | Not used | Used to estimate the remaining cost |
| Priority queue | Yes | Yes |
| Search direction | Neighbor exploration | Node with the lowest estimated cost first |