Question

In many problems the path to goal is irrelevant, this class of problems can be solved using ____________

(a) Informed Search Techniques

(b) Uninformed Search Techniques

(c) Local Search Techniques

(d) Informed & Uninformed Search Techniques

I have been asked this question by my college director while I was bunking the class.

This interesting question is from Local Search Problems and Optimization Problems topic in section Problem Solving of Artificial Intelligence

Answer 1

The correct option is (c) Local Search Techniques

For explanation: If the path to the goal does not matter, we might consider a different class of algorithms, ones that do not worry about paths at all. Local search algorithms operate using a single current state (rather than multiple paths) and generally move only to neighbors of that state.