Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.

Artificial Intelligence - Quiz(MCQ)

Evaluation function returning highest evaluation

Evaluation function returning lowest evaluation

Evaluation function returning lowest & highest evaluation

None of the above

Correct Answer : Evaluation function returning lowest evaluation

Explanation : Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f (n). Traditionally, the node with the lowest evaluation is selected for expansion, because the evaluation measures distance to the goal.

Recently Updated in Artificial Intelligence Questions

Which of the following are used for modeling times series and sequences?

Decision graphs

Dynamic Bayesian networks

Parameter tuning

Value of information

Correct Answer : Dynamic Bayesian networks

Explanation : Dynamic Bayesian networks (DBNs) are used for modeling times series and sequences.

The generalized form of Bayesian network that represents and solve decision problems under uncertain knowledge is known as an?

Influence diagram

Directed Acyclic Graph

Table of conditional probabilities

None of the above

Correct Answer : Influence diagram

Explanation : The generalized form of Bayesian network that represents and solve decision problems under uncertain knowledge is known as an Influence diagram

How can you evaluate 1.25 + sqrt (144) in LISP?

1.25+sqrt (1.44)

(1.25+sqrt (1.44))

(+1.25 sqrt (1.44)

All of the above

Correct Answer : (+1.25 sqrt (1.44)