search space

The set of all candidate solutions an algorithm might consider, often pictured as a tree of choices.

In more detail

Backtracking walks the search space depth-first and pruning shrinks it. Its size, such as n factorial orderings or 2^n subsets, tells you how hopeless an exhaustive search would be.

Related terms

Taught in

References