What is the primary drawback of using a purely heuristic search strategy?Options It is computationally expensiveIt may overlook promising paths It cannot be used in AI applicationsIt always finds the optimal solution
Question
What is the primary drawback of using a purely heuristic search strategy?Options It is computationally expensiveIt may overlook promising paths It cannot be used in AI applicationsIt always finds the optimal solution
Solution
The primary drawback of using a purely heuristic search strategy is that it may overlook promising paths. This is because heuristic search strategies make decisions based on rules or algorithms that do not always guarantee the best solution, but rather a good enough solution. Therefore, they may miss other potential solutions that could be better.
Similar Questions
What is the primary goal of informed (heuristic) search strategies in AI?OptionsTo avoid using heuristics altogether To find the optimal solution as quickly as possibleTo explore all possible states exhaustivelyTo use domain-specific knowledge to guide the search
What is a heuristic function, and why is it important in A* search?
What is the difference between algorithms and heuristics?Group of answer choicesAlgorithms may require too much time or storage to be practical; heuristics often get a 'good enough' answer, and do it quicklyHeuristics can't be coded onto a computer, algorithms can.None; they're different terms for the same thingAlgorithms are always inefficient, heuristics are always effiicient
11. Which of the following is a disadvantage of informed search strategies in AI? a) They are often more computationally efficient than uninformed search strategies b) They can be more complex to implement than uninformed search strategies c) They are always guaranteed to find the optimal solution d) They do not use any domain-specific knowledge to guide the search
Suppose you were applying the Graph Search version of A* Search to a search problem. Using an admissible heuristic would guarantee that:Group of answer choicesAll nodes expanded by the search algorithm will have the same value of f(n).The first solution found is an optimal solution.The heuristic is also consistent.None of the above.
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.