A Search Space is the full set of candidate configurations, such as hyperparameter values, architectures, or solutions, that an optimisation or search algorithm is permitted to explore in pursuit of an objective. Its size and structure directly determine how tractable a search problem is: a poorly bounded or high-dimensional search space can make exhaustive search infeasible. Algorithms such as grid search and random search differ chiefly in how they sample points from this space.