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

Discussion

What does optimality mean for a search algorithm?

  • A.It uses the least memory of any algorithm for the problem
  • B.It expands the smallest possible number of nodes
  • C.It runs faster than any competing algorithm on the problem
  • D.It returns a solution of lowest path cost when one exists

Answer: D

Optimality concerns the quality of the solution returned, not the efficiency of the search, so an algorithm can be optimal and extremely slow, or fast and suboptimal. Efficiency in nodes expanded is sometimes called optimal efficiency, which is a different property and a frequent source of confusion. Distinguishing the quality of the answer from the cost of obtaining it is essential when reading any claim of optimality.

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

Post your comment

Please log in or register to post a comment.