We can say that A* Search is the best search option. Also, it helps in avoiding expensive growth. Although, the most promising path first expands. f(n)= g(n) + h(n), where g(n) is the cost of reaching the h(n) node, the estimated cost of reaching the f(n) target from the node is defined as the estimated total cost of traveling through n to the target. Also, by increasing f(n) with the use of priority queue we can implement it in AI.