As I went through the algorithm, I found that failure is happened if RECURSIVE-DLS, for example, faces an empty node when value of limit is not zero. For example, failure can happen if the value of limit is greater than depth of the search tree and algorithm faces an empty node.
I wish my undrestanding would be correct!
--- In firstname.lastname@example.org, "spsycoder" wrote:
> Hi everyone,
> in Fig. 3.17 page 88 (3rd ed.) we have got a version of DLS algorithm,
> after putting some attention on it, i realized that the output is cutoff all the time-if it does not find the solution in that depth limit of course. what does it mean to return failure?!
> Am I correct? or is there any misunderstanding?
> Saman .M.G.