Heuristic Search: A* Search

In uninformed search, we do not look ahead of the goal. In other words, we do not ask the question "What is the cost of getting to the goal?". In order to guess the cost of getting to the goal from a state in a search, we need a heuristic function h(n), which is specific to the domain. In this way, the search will be more intelligent than the blind search. Instead of real cost functions of getting to the node, we consider heuristic function and estimates to get to the goal.