rotaproof.vercel.app

solve_roster

Runs the exact solver over the current rules and returns one of three answers. optimal — a schedule exists and no better one exists under these rules. The objective is the total soft-rule cost; lower is better. Read the schedule with inspect_schedule. infeasible — no schedule can satisfy the hard rules. Nothing is returned that looks like a schedule, because none exists. Call explain_conflict for the smallest set of rules that cannot coexist, then relax exactly one of them. timeout — the time limit was reached before optimality was proved. Any schedule returned is valid but may not be the best. The result is deterministic: the same rules always produce the same answer, and every run returns a receipt containing a hash of the model and of the schedule, so a result can be reproduced and checked later.

Page: /

Input schema

{
  "type": "object",
  "properties": {
    "timeLimitMs": {
      "type": "integer",
      "minimum": 200,
      "maximum": 30000,
      "description": "Solver time budget in milliseconds. Default 10000."
    }
  },
  "additionalProperties": false
}