Link to the paper(https://www.researchgate.net/publication/364921310_Comparative_Analysis_of_Search_Algorithms_in_AI)
Searching
Searching is a very important part of modern systems and there are many algorithms to achieve efficient searching.
Examples:
1- Navigation systems
2- Ai bots in games
3- Path finding
Types:
Search algorithms are divided into 2 categories.
i)-Uninformed Search
1- BFS
2- DFS
3- Iterative deepening search
4- UCS
5- Bidirectional search
6- Depth limited search
ii)-Informed Search
1- Best First
2- A*
3- Hill Climbing
Shortest Path:
Breadth First Seach is the algorithm which finds the shortest path by exploring each node level by level but it takes alot of memory as it explores each node and there are no weights to judge nodes.
Infinte Path Problem:
Depth limited search is used to get rid of infinite path problems by setting a max depth limit but if a goal is deeper than our set limit, this algorithm with fail to find the path.
Reduced Complexity:
Bidirectional search can reduce time complexity by starting frim initial and end goal to reach a middle node.
How heuristic values help in efficiency:
Algorithms which use heurtistic values reduce the search space and find the shortest and optimal path in no time.
Top comments (0)