The complexity with solution at depth k and branching factor bfor iterative deepening,
b^k x (b/b-1)^2
with b − 1 on the denominator is not a good approximation when b≈ 1. I was wondering what is a better estimate of the complexity ofiterative deepening when b ≈ 1. (Hint: think about the case when b= 1.) Also I was wondering how does this compare with the A∗ forsuch graphs. Could you suggest a way that iterative deepening canhave a lower overhead(less complexity) when the branching factor isclose to 1.
Expert Answer
An answer will be send to you shortly. . .
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured