An A* algorithm is a heuristic search technique which
PYQ UGC NET 2014
An A* algorithm is a heuristic search technique which
- A.
is like a depth-first search where most promising child is selected for expansion
- B.
generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost.
- C.
saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion.
- D.
none of the above
Attempted by 160 students.
Sign up free to check your answer
Sign up freeLoading lesson…

