Suppose you are applying the Tree Search version of Greedy Best-First Search to a search problem. Using an admissible heuristic would guarantee:Group of answer choicesTermination whenever the set of states is finite.Optimality of the first solution found.Consistency of the heuristic.None of the above. Flag question: Question 5
Question
Suppose you are applying the Tree Search version of Greedy Best-First Search to a search problem. Using an admissible heuristic would guarantee:Group of answer choicesTermination whenever the set of states is finite.Optimality of the first solution found.Consistency of the heuristic.None of the above. Flag question: Question 5
Solution
None of the above.
Explanation:
-
Termination whenever the set of states is finite: This is not guaranteed by an admissible heuristic. An admissible heuristic is one that never overestimates the cost to reach the goal. It doesn't guarantee termination.
-
Optimality of the first solution found: This is not guaranteed by an admissible heuristic in the context of Greedy Best-First Search. While an admissible heuristic guarantees optimality in A* search, it doesn't in Greedy Best-First Search because this algorithm is not optimal.
-
Consistency of the heuristic: An admissible heuristic does not necessarily have to be consistent. Consistency (or monotonicity) is a property that some heuristics have, but it's not a requirement for a heuristic to be admissible.
So, the correct answer is "None of the above".
Similar Questions
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.
Exercise 5.1 (1+1 marks)Execute(a) greedy best-first search (f (n) = h(n.state)) and(b) A∗ (f (n) = g(n) + h(n.state))without reopening in the state space depicted below. As heuristic, use the perfect heuristic h∗.sIs1s2 s3sg515121Describe the execution of both search algorithms with the following schema:1. expanding s10: open = ⟨s11(f = 5), s12(f = 6)⟩, closed = {s10(g = 0)}2. expanding s11: open = ⟨s13(f = 4), s12(f = 6), s16(f = 10)⟩, closed = {s10(g = 0), s11(g = 3)}. . .i. expanding si: found goal with cost xNote: This schema uses fictitious states and numbers that don’t correspond to the given state space
Our binary search trees do not allow duplicate elements.Group of answer choicesTrueFalse
Select the correct answerWhich of the following is an example of an informed (heuristic) search algorithm?OptionsBreadth-First Search (BFS) Depth-First Search (DFS)A* searchHill Climbing
The Data structure used in standard implementation of Breadth First Search is?Group of answer choicesStackTreeQueueLinked List
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.