Open AccessFinding Optimal Algorithm in Artificial Intelligence
Author(s) -
I.Parvin Begum,
I.Shahina Begam
Publication year - 2021
Publication title -
international journal of computer science and mobile computing
Language(s) - English
Resource type - Journals
ISSN - 2320-088X
DOI - 10.47760/ijcsmc.2021.v10i07.012
Subject(s) - best first search , incremental heuristic search , beam search , search algorithm , iterative deepening depth first search , bidirectional search , beam stack search , computer science , heuristic , depth first search , focus (optics) , artificial intelligence , path (computing) , algorithm , hill climbing , guided local search , combinatorial search , machine learning , physics , optics , programming language
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.