GREEDY BEST FIRST SEARCH
Anuj Singh
Student, Data Science
NMIMS, Indore
Greedy best first search algorithm always chooses the path which is best at that moment and closest to the goal. It is the combination of Breadth First Search and Depth First Search. With the help of Best First Search, at each step, we can choose the most promising node
In this search example, we are using two lists which are opened and closed.
Final Solution path will S – B – F – G
Advantages:
- It is more efficient than Breadth First Search and Depth First Search
- Time Complexity is less than that of Breadth First Search
- The Best first search allows us to switch between paths by gaining the benefits of both breadth first and depth first search. Because, depth first is good because a solution can be found without computing all nodes and Breadth first search is good because it does not get trapped in dead ends.
Disadvantages:
- Sometimes, it covers more distance than predicted.