Skip to content

Solution Space Bounding

Bound a potentially unbounded or enormous solution space so search becomes possible.

The Diagnostic Story

Symptom: The search task stalls because no one can say when it is complete enough — the space is open-ended, and different actors are searching different implicit scopes, producing incompatible shortlists nobody can reconcile. Important options are excluded informally and resurface later as out-of-scope disputes. The budget is consumed before high-value regions are inspected. The work oscillates between limitless brainstorming and premature narrowing, with neither producing a defensible result.

Pivot: Estimate or characterize the size of the possibility space, define an explicit working boundary with stated inclusion and exclusion rules, choose a search strategy suited to the bounded space, and preserve a false-exclusion review so the boundary remains legitimate and can be revised when evidence demands it.

Resolution: Search becomes feasible because it has a declared scope, and the scope is legible because exclusions are justified and documented. The cognitive and computational burden drops, and downstream methods can be chosen to fit the bounded space rather than an unbounded one. Later reviewers can distinguish justified omission from blind spot because excluded cases are recorded.

Reach for this when you hear…

[competitive intelligence] “We can't scan every company in the world — we need to define the market boundary first and agree on it, otherwise everyone's analysis covers a different universe.”

[legal due diligence] “Opposing counsel will claim we missed something — that's why we document the scope of review upfront, so we can show what was in and out and why.”

[research synthesis] “The search protocol has to specify the databases, date range, and inclusion criteria before we start — if we just search until we feel satisfied, the result is not reproducible.”

Mechanisms / Implementations

  • Finite Horizon Assumption: This is a method that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Candidate Cap: This is a protocol that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Domain Restriction: This is a protocol that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Search Filter: This is a software_or_tool that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Sampling Frame Definition: This is a method that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Bounded Planning Window: This is a artifact that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Scope Statement: This is a document that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Eligibility Screen: This is a checklist that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.
  • Branch-and-Bound Procedure: This is a method that implements Solution Space Bounding when it is used to make an oversized or unbounded candidate space manageable.

Abstractions this archetype builds on — directly (a source ingredient) or as a related pattern. Links follow the typed catalog namespace.

Built directly on (3)

Also references 11 related abstractions

Variants

Narrower or domain-specific specializations that share this archetype's core structure. Recognized variants are established; candidate variants are provisional.

Finite Horizon Bounding · temporal variant · recognized

Bounds an otherwise open-ended temporal space by choosing a reviewable planning, forecasting, or valuation horizon.

Domain-Restricted Search · domain variant · recognized

Bounds the search space by limiting consideration to a defined domain, jurisdiction, technical family, population, or case class.

Candidate-Cap Bounding · implementation variant · recognized

Bounds search by imposing a maximum number of candidates for comparison, review, voting, testing, or shortlisting.

Sampling-Frame Bounding · mechanism family variant · recognized

Bounds an unknown or very large population by defining the frame from which observations, records, cases, or examples will be sampled.