Depth-limited search

Depth-limited search is really similar to Depth-first search. The only difference is that there is a depth limit which cant be crossed.
Just imagine that the tree ends at that limit and perform normal Depth-first search.

Also see Iterative Deepening search.