4 ms·
It's neither a hack nor trying to "behave" like anything. It is complete and optimal, with provable properties. Whenever there exists an admissible heuristic,
by JohnKemeny 1y ago
It's neither a hack nor trying to "behave" like anything.
It is complete and optimal, with provable properties.
Whenever there exists an admissible heuristic, you should use A* over Dijkstra's algorithm.
- HelloNurse 1y agoEven inadmissible heuristics can have their place, and it is easy to reason about how suboptimal they can be: you might want to trade off optimal results for performance (i.e. ignoring some part of the search space that should be searched) or to make an agent in a game a little stupid or stylized (e.g. prone to zig-zagging).
- kccqzy 1y agoOP's point, I believe, is that inadmissible heuristics sometimes give behaviors that seem more natural, even if not optimal.