Difference between Informed and Uninformed Search in AI

Pre-requisite: Search Algorithms in
Artificial Intelligence

Informed Search: Informed Search algorithms have information on the goal state which helps in more efficient searching. This information is obtained by a function that estimates how close a state is to the goal state.
Example: Greedy Search and Graph Search

Uninformed Search: Uninformed search algorithms have no additional information on the goal node other than the one provided in the problem definition. The plans to reach the goal state from the start state differ only by the order and length of actions.
Examples: Depth First Search and Breadth-First Search



Informed Search vs. Uninformed Search:

Informed Search Uninformed Search
It uses knowledge for the searching process. It doesn’t use knowledge for searching process.
It finds solution more quickly. It finds solution slow as compared to informed search.
It is highly efficient. It is mandatory efficient.
Cost is low. Cost is high.
It consumes less time. It consumes moderate time.
It provides the direction regarding the solution. No suggestion is given regarding the solution in it.
It is less lengthy while implementation. It is more lengthy while implementation.
Greedy Search, A* Search, Graph Search Depth First Search, Breadth First Search

GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.