title: Overhead effect in Iterative Deepening by increasing branching factor and depth
body: <p>I am studying Iterative Deepening from this <a href="https://en.wikipedia.org/wiki/Iterative_deepening_depth-first_search" rel="nofollow">link</a>. My main concern is with <strong>Overhead</strong>. That link says that </p>
  
  <blockquote>
    <p>The higher the branching factor, the lower the overhead of repeatedly
    expanded states</p>
  </blockquote>
  
  <p><br>There is no explanation given for this statement and also no convincing arguments are given at that link. I am searching the reason behind this statement because I think that overhead should increase as branching factor is increasing and it also means that no of nodes are increasing then how overhead is reducing?</p>
  
  <p>Till now I did not find anything reasonable and helpful. If someone can help in correcting my concepts then I would be thankful to you.</p>