A heuristic is a way of trying ___________ – McqOptions

MCQOPTIONS

1.	A heuristic is a way of trying ___________
A.	To discover something or an idea embedded in a program
B.	To search and measure how far a node in a search tree seems to be from a goal
C.	To compare two nodes in a search tree to see if one is better than another
D.	All of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

What is the evaluation function in A* approach?
What is the evaluation function in greedy approach?
Greedy search strategy chooses the node for expansion in ___________
Heuristic function h(n) is ________
The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function.
The search strategy the uses a problem specific knowledge is known as ___________
A* algorithm is based on ___________
A heuristic is a way of trying ___________