Search depth
= Search depth
{title2=$d(n)$}
The number of action edges between a <search node> and the root of its <search tree>. It is zero at the root. When every step costs more than $\epsilon>0$, a positive-depth node satisfies $g(n)>d(n)\epsilon$, connecting depth finiteness to <path cost> bounds.