a) Best-first search b) Greedy best-first search c) A* search d) None of the mentioned Answer: b ...
View QuestionWhich is used to improve the performance of heuristic search?
a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) ...
View QuestionWhich search is complete and optimal when h(n) is consistent?
a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search Answer: d
View QuestionWhich method is used to search better by learning?
a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned
View QuestionWhich search uses only the linear space for searching?
a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned
View QuestionWhat is the heuristic function of greedy best-first search?
a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n) Answer: c Explanation: ...
View QuestionWhich search uses the problem specific knowledge beyond the definition of the problem?
a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search
View QuestionHow many types of informed search method are in artificial intelligence?
a) 1 b) 2 c) 3 d) 4 Answer: d Explanation: The four types of ...
View QuestionWhich function will select the lowest expansion node at first for evaluation?
a) Greedy best-first search b) Best-first search c) Depth-first search d) None of the mentioned Answer: ...
View QuestionWhat is the other name of informed search strategy?
a) Simple search b) Heuristic search c) Online search d) None of the mentioned Answer: b Explanation: ...
View Question