Explore Courses Blog Tutorials Interview Questions
0 votes
in AI and Deep Learning by (17.6k points)

I want to ask about the search functions in AI as I am not able to understand them. However, I know that the Uniform-cost search is a special case of the algorithm, A* search, when its heuristic is a constant function. I also know that the Breadth-first search (BFS) is a special case of A* if all edge costs are identical and positive. The Best-first search is a special case of A* search as well. But, the problem I face is how I do show it? How do I prove that all the above-mentioned instances are accurate?

1 Answer

0 votes
by (108k points)

Please be informed that the A* is having a heuristic function, that will greedily explore the tree that will select the most assuring branches.

Let's say if the cost for each edge is same, then A* only begins with the nodes that are at "distance 1" because they all have the least cost. A* searches the nodes at "distance 2" from the root node because of their least cost. Thus, it recursively, leads to BFS.

For more information, do refer to the Artificial Intelligence course.

Browse Categories