An A* algorithm is a heuristic search technique which

PYQ UGC NET 2014

An A* algorithm is a heuristic search technique which

  1. A.

    is like a depth-first search where most promising child is selected for expansion

  2. 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.

  3. C.

    saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion.

  4. D.

    none of the above

Attempted by 160 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…