Best-first search algorithm always selects the path which appears best at that moment. It is also called as Greedy search. It is the combination of Breadth First Search (BFS) and Depth First Search (DFS) algorithms. it uses the heuristic function and search. best-first search allows us to take the advantages of both the algorithms. At each step we can choose most promising node with the help of best-first search. we expand the node which is closest to the goal node and the minimum cost is estimated by the heuristic function. It is implemented by the priority queue.
The worst-case time complexity is O(bm)
The worst-case space complexity is O(b m ), where m is the maximum depth of the search space.
Greedy best-first search algorithm is incomplete, even if the given state space is finite.
greedy best-first search algorithm is not optimal.
Silan Software is one of the India's leading provider of offline & online training for Java, Python, AI (Machine Learning, Deep Learning), Data Science, Software Development & many more emerging Technologies.
We provide Academic Training || Industrial Training || Corporate Training || Internship || Java || Python || AI using Python || Data Science etc