The correct answer is: B. Uninformed Search
Uninformed search is a type of search algorithm that does not use any knowledge of the problem domain to guide its search. It simply explores all possible states of the search space, without regard for whether they are likely to lead to the goal state.
Uninformed search is often used as a baseline algorithm for comparison with other, more sophisticated search algorithms. It is also used in some cases where it is not possible to obtain any knowledge of the problem domain.
Here are brief descriptions of each option:
- A. Informed Search is a type of search algorithm that uses knowledge of the problem domain to guide its search. This knowledge can be in the form of a heuristic function, which estimates the cost of reaching the goal state from a given state, or in the form of a search tree, which represents the possible states of the search space.
- C. Informed & Unformed Search is not a valid option.
- D. Heuristic Search is a type of search algorithm that uses a heuristic function to guide its search. A heuristic function is a function that estimates the cost of reaching the goal state from a given state. Heuristic search is often used in cases where it is not possible to obtain an exact solution to the problem.