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. Only a and b
Answer:A
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. Only a and b
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.