- If we are only interested in one solution, there is no need to explore the entire search tree. Ideally, we would just explore the path leading from the root to the solution.
- If we are interested in all solutions, we need to explore the entire search tree. However, whether we explore the tree in depth-first or breadth-first manner will make a big difference in the memory needed. The memory requirements of breadth-first exploration are typically exponentially larger than those of depth-first exploration.

The above assumptions ensure that the exploration of a search tree is a deterministic process, provided the branching strategy generating the constraints to branch with is deterministic.

Andreas Rossberg 2006-08-28