Iterative Deepening Depth First Search 2

The video revisits the example of IDDFS 1, but with an eye towards analysis, then discusses asymptotic time analyses of IDDFS and Breadth First search. The video concludes with a discussion of the IDDFS (idsearch) algorithm (and depth-bounded, dbsearch, too) as given in Poole and Mackworth's slide deck. In the dbsearch pseudocode, and my voice over, there is reference to Bound = 0 -- this is NOT a test of whether the bound that is initially passed from idsearch is 0 (though it could be), but whether the recursion (the recursive calls in dbsearch, each time decrementing Bound) has gone through the requisite number of levels specified by the bounding value that is initially passed from idsearch. Also, a common question and a very good one, is whether there are versions of idsearch that skip levels! The answer is 'yes' -- there are. IDA* is one such version, though we might imagine other simpler versions that simply increment Bound by more than 1, perhaps by a function, on each iteration through the REPEAT/UNTIL loop