A* algorithm is based on ___________ – McqOptions

MCQOPTIONS

1.	A* algorithm is based on ___________
A.	Breadth-First-Search
B.	Depth-First Search
C.	Best-First-Search
D.	Hill climbing
Answer» D. Hill climbing

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 ___________