Monday, 18 February 2019

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*.
at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

std::next_permutation(arr.begin(),arr.end());

What is next_permutation(a.begin(),a.end()) ? Next permutation is like what its name says, finds the next permutation of a and assigns ...

  • __int128_t and __float128 in GNU
    Usage of __int128_t: supports really big intermediate numbers, from -2^128 + 1 to 2^128 - 1 it has 128 bits Usage of __float128 : ...
  • Info (1) Cup 2019
    This is one of the not interactive question. (2 out of 4 questions are interactive questions). You can try it ! InfO(1) CUP 2019 Third ...
  • Distances
    There are many different distances but today we will be talking about Manhattan distance and Euclidean distance. Mahattan distance is based ...