Mention the difference between breadth first search and best first search in artificial intelligence?
- 1 Answers
- 997 Views
- I also Faced
- E-Mail Answers
Answer Posted / Sandip Kumar Maurya
Breadth First Search (BFS) is a graph traversal algorithm that explores all the neighbors of a given node before moving on to the next level. It uses a queue to store the nodes to be visited. On the other hand, Best First Search (BFS*) is an extension of BFS where the search expands the lowest-f(n) score node first, using a priority queue instead of a simple queue. In BFS*, f(n) is a heuristic function that estimates the cost from the current node to the goal.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
