Skip to content

Type Alias: SearchModeDto

@kortexya/reasoninglayer


@kortexya/reasoninglayer / Spaces / SearchModeDto

Type Alias: SearchModeDto

SearchModeDto = "solutions" | "feasibility"

Defined in: src/types/spaces.ts:163

Which computation the search endpoint should perform.

Remarks

  • "solutions": enumerate complete, valid assignments (default — backward compatible).
  • "feasibility": run 2×N per-variable SAT queries and return reachability info. Much faster than full enumeration for large spaces.

For scheduling-shaped problems (staff rostering, vehicle-to-route assignment, task-to-worker matching, etc.) use the dedicated SchedulingClient.feasibility | `client.scheduling.feasibility()` endpoint instead of routing through ComputationSpace. It accepts a native scheduling problem definition and returns structured per-cell feasibility classifications — no string-encoded variable names on the wire, and it preserves real role names end-to-end.