Machine-translated by Google. Questions are authored in English.
Top

Discussion

What does A star expand before finding an optimal solution?

  • A.Every node at a depth less than the solution depth
  • B.Every node reachable from the initial state
  • C.Only the nodes lying on the optimal path itself
  • D.Every node with f less than the optimal cost

Answer: D

A star must expand all nodes whose estimated total cost is below the optimal, since any of them might lead somewhere better, and may expand some with f equal to it. That is why a better heuristic, which raises f towards the truth for unpromising nodes, prunes so effectively. Depth and reachability are not the criterion, and expanding only the solution path would require a perfect heuristic. Knowing exactly which nodes an algorithm must examine is what allows two heuristics to be compared.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.