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

Discussion

Why is the repeated work of iterative deepening acceptable?

  • A.The algorithm remembers nodes between iterations
  • B.Most branches are pruned before being expanded again
  • C.The last level dominates the node count in an exponential tree
  • D.Each iteration is faster than the one before it

Answer: C

In a tree with branching factor b, the bottom level holds more nodes than all the levels above it combined, so regenerating the upper levels adds only a constant factor of about b over b minus one. For a branching factor of ten that is eleven per cent. Nothing is remembered between iterations, and no pruning occurs. An overhead that appears alarming until the exponential is examined is a good illustration of why complexity arguments must be done rather than estimated.

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

Post your comment

Please log in or register to post a comment.