Search depth ($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 $ϵ>0$, a positive-depth node satisfies $g(n)>d(n)ϵ$, connecting depth finiteness to path cost bounds.