Comparative Analysis of Various Uninformed Searching Algorithms in AI

In Artificial Intelligence the search algorithm plays a vital role to figure out the problems of the shortest path finding. These search algorithms can be classified into two categories. That is, uninformed search algorithm and informed search algorithm. In this article, I am only paying attention on various uninformed search algorithms such as, Depth First Search (DFS), Breadth First Search (BFS), Iterative Deepening Search (IDS), Uniform Cost Search (UCS) and Depth Limit Search (DLS). This paper also includes how these algorithms do work in real time applications. I made various comparisons of these searching algorithms based on time complexity, space complexity, optimality and completeness. Out of all the above said algorithms the comparison result shows that Uniform Cost Search provides the optimal solution.