14 Jan 2004
CS 3243 - Blind Search
51
Iterative deepening search
nNumber of nodes generated in a depth-limited search to depth d with branching factor b:
n NDLS = b0 + b1 + b2 + … + bd-2 + bd-1 + bd 
n
nNumber of nodes generated in an iterative deepening search to depth d with branching factor b:
nNIDS = (d+1)b0 + d b^1 + (d-1)b^2 + … + 3bd-2 +2bd-1 + 1bd 
n
nFor b = 10, d = 5,
nNDLS = 1 + 10 + 100 + 1,000 + 10,000 + 100,000 = 111,111
nNIDS = 6 + 50 + 400 + 3,000 + 20,000 + 100,000 = 123,456
n
nOverhead = (123,456 - 111,111)/111,111 = 11%