Comparative Analysis of Search Algorithms

Abstract

Nowadays many artificial intelligence search algorithms are available to figure out the problem of shortest path finding. The paper presents the detailed study of informed search and uninformed search techniques. The paper focuses more towards uninformed search strategies such as BFS, DFS, and UCS and informed search strategies like A*, and Best First Search. The paper includes working of search techniques, their merits, and demerits, where these algorithms are applicable, also open and closed list for each algorithm are shown. At last comparison of search techniques based on complexity, optimality and completeness are presented in tabular form.