- Best-first search algorithm visits next state based on heuristics function f(n) = h with lowest heuristic value (often called greedy). It doesn’t consider cost of the path to that particular state. All it cares about is that which next state from the current state has lowest heuristics. Heuristic evaluation function
f(n), in general, may depend on the description of n, the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain.
- A* search algorithm visits next state based on heuristics f(n) = h + g where h component is same heuristics applied as in Best-first search but g component is path from the initial state to the particular state. Therefore it doesn’t chooses next state only with lowest heuristics value but one that gives lowest value when considering it’s heuristics and cost of getting to that state.
VietMX Staff asked 3 years ago
