Explore Courses Blog Tutorials Interview Questions
+2 votes
in AI and Deep Learning by (50.2k points)

What is the difference between informed and uninformed searches? Can you explain this with some examples?

3 Answers

+3 votes
by (108k points)
edited by

An uninformed search is a searching technique that has no additional information about the distance from the current state to the goal.

Informed Search is another technique that has additional information about the estimate distance from the current state to the goal.

Basis of comparison

Informed search

Uninformed search

Basic knowledge

Uses knowledge to find the steps to the solution.

No use of knowledge


Highly efficient as consumes less time and cost.

Efficiency is mediatory



Comparatively high


Finds the solution more quickly.

Speed is slower than the informed search.


Heuristic depth-first and breadth-first search, and A* search

Depth-first search, breadth-first search, and lowest cost first search

If you want to make your career in Artificial Intelligence then go through this video:

by (19.7k points)
Very well explained!
by (19.9k points)
This was easy to understand. Thank you.
by (33.1k points)
Thanks for this clear explanation.
by (44.4k points)
Very nice answer!
by (47.2k points)
Uniformed search is less efficient whereas informed search is more efficient.
by (32.1k points)
Very good explanation!
0 votes
by (29.3k points)

Key Differences Between Informed and Uninformed Search

  • The former informed search technique uses knowledge in order to find a solution. 
  • The latter uninformed search technique does not use knowledge. 
  • In simpler terms, the uninformed search doesn't know any further information about the solution.
  • In terms of efficiency informed search is better than the uninformed search.
  • Uninformed search consumes more time and cost as it has no clue about the solution as compared to an informed search.
  • Depth-first search, breadth-first search, and lowest cost first search are the algorithms come under the category of the uninformed search. T
  • The informed search covers the algorithms such as heuristic depth-first, heuristic breadth-first search, and A* search.


The informed search will provide the direction regarding the solution while in uninformed search has no suggestion regarding the solution. This makes an uninformed search more lengthy when the algorithm is implemented.

by (108k points)
"In terms of efficiency"-- which efficiency? can you elaborate more???
by (29.5k points)
i think by efficiency he means accuracy
0 votes
by (106k points)

Uninformed search:-

It is called as brute-force or "blind" search. Uninformed Searched uses no knowledge about the problem, hence possibly less efficient than an informed search.

Examples of uninformed search algorithm:-

Breadth-first search and Depth-first search, Depth-limited search, Uniform-cost search, Depth-first iterative deepening search and bidirectional search.

Informed search:-

It is also called "heuristic search", it uses prior knowledge or "domain knowledge" about the problem, hence possibly more efficient than uninformed search.

Examples of informed search algorithm:-

Best-first search and A*.

Browse Categories