Informed and Uninformed Search

Uninformed Search

Searching is a process of considering possible sequences of actions.

A problem consists of four parts : the initial state, a set of operators, a goal test function and a path cost function. Search algorithms are judged on the basis of completeness, optimality, time complexity, space complexity. Uninformed search is also sometimes called blind search.

Exemples of uninformed search : Breath First Search, Depth First Search, DF-ID, IDS ...

Informed Search

Unlike Uninformed Search, Informed Search knows some informqtion that can help us to  improve path selection with generally a distance function (ex. Mahattan distance, Euclidean distance) or some direction (ex. If we prefer south then the search will be towards south direction).

Exemples of informed search : Best First Search, Heuristic Search such as A*.