Examples
Examples
Try the starting example
- JSON Athletes [ID,leg times seconds indexed by leg,eligible leg numbers]
- [["A",[60,65],[1,2]],["B",[62,60],[1,2]],["C",[70,61],[2]]]
- Leg count
- 2
- Minimum-time eligible leg order
- ["A","B"]
- Minimum total supplied time (seconds)
- 120
Try another scenario
- JSON Athletes [ID,leg times seconds indexed by leg,eligible leg numbers]
- [["A",[60,65],[1,2]],["B",[62,66],[1,2]],["C",[70,61],[2]]]
- Leg count
- 2
- Minimum-time eligible leg order
- ["A","C"]
- Minimum total supplied time (seconds)
- 121
Calculation method
Calculation method
Minimum-time eligible leg order
Exhaustively enumerate distinct-athlete permutations, keep eligible legs; choose minimum sum, lexicographic athlete IDs for ties.
Minimum total supplied time (seconds)
Sum leg-specific supplied times for chosen assignment; zero with explicit no-feasible-order string if infeasible.
Symbols and units
- a
- JSON Athletes [ID,leg times seconds indexed by leg,eligible leg numbers]
- b
- Leg count
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- Exact best assignment under independent leg-specific times, distinct athletes and explicit eligibility. No fatigue, exchange or interaction model. Supported limits: At most 8 athletes and 6 legs; leg count≤athletes. All supplied times positive.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.