Has some domain knowledge Usually more efficient than blind searches Also called informed search Heuristic searches work by deciding which is the next best node to expand (there
Â
A * algorithm is a searching algorithm that searches for the shortest path between the initial and the final state. f(n) =g(n) + h(n) g(n) = Actual cost from Start node to n node h(n) = Estimation Cost from n to Goal node.
Â
Greedy best-first search algorithm always selects the path which appears best at that moment. It is the combination of depth-first search and breadth-first search
Â
Heuristic in AI (Rule of thumb) [what, why, how] What: Mental shortcuts that ease the cognitive load of making a decision. Why: Solve problems and speed up our decision-making process How: Eucledian Distance, Manhattan Distance, etc
![Heuristic in AI (Rule of thumb) [what, why, how] What: Mental shortcuts that ease the cognitive load of making a decision. Why: Solve problems and speed up our decision-making process How: Eucledian Distance, Manhattan Distance, etc](https://cdn.slidesharecdn.com/ss_thumbnails/3-5-week-250901055018-f7c36e71-thumbnail.jpg?width=560&fit=bounds)