Present days many artificial intelligence search algorithms are plays a important to figure out the problem of shortest path finding. The paper presents the detailed study of heuristic search and blind search techniques. The paper focus additional in the direction of blind search strategies such as Breadth First Search, Depth First Search, and Uniform Cost Search and informed explore strategies like A*, and Best First Search. The paper consist of effective of search procedure, their qualities, and demerits, where these algorithms are applicable, also at last comparison of search techniques based on complexity, optimality and completeness are presented in tabular structure.
Finding Optimal Algorithm in Artificial Intelligence
