Artificial Intelligence: Uninformed Search
In this post i will try to give brief details about a kind of search strategies used by artificially intelligent agents called “Uninformed search”.
Any agent(human or artificial) tries to find solution to a problem by trying all the possible ways the problem can be solved,if more than one possibility is found to solve that problem, then obviously the optimal one will be chosen, This approach is called “Problem solving by search”.
As the name implies, Uninformed search doesn’t need to know about the domain/environment in which it is searching for a solution. There are several variants in uninformed search strategy.
- Breadth First Search (BFS): Expands shallowest node first.
- Depth First Search (DFS): Expands deepest node first.
- Depth Limited Search (DLS): DFS with limited depth.
- Iterative Deepening Search (IDS) : DLS with increasing depth limit.
- Uniform Cost Search (UCS): Expands Least cost node first. (similar to Dijsktra’s algorithm)
This is the end of this post. Please provide comments to improve the quality of my posts.