Depth-first search
A search strategy that explores one path to its end before backtracking to try alternatives. Depth-first search requires less memory than breadth-first but may explore very long paths and does not guarantee finding the shortest solution.