Characterization

Stack
Memory – linear function of length
For finite graphs – complete strategy
Incomplete strategy for graphs with infinite branches (often)
Depth-bound algorithms
Cost-bound algorithms
Efficient when many branches of approximately equal length