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

Discussion

What is the effect of a very small branching factor on iterative deepening?

  • A.The algorithm becomes incomplete for narrow trees
  • B.The memory requirement rises towards that of breadth first
  • C.The optimality guarantee no longer holds with unit costs
  • D.The repeated work becomes a larger fraction of the total

Answer: D

The overhead factor is b over b minus one, so a branching factor of two doubles the work while a branching factor of ten adds only eleven per cent. For very narrow trees the argument for iterative deepening weakens considerably. Completeness, memory and optimality are unaffected. A justification that depends on a parameter must be rechecked whenever that parameter is unusual, and a branching factor of two is exactly such a case.

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

Post your comment

Please log in or register to post a comment.