Examples
Examples
Try the starting example
- Events JSON [ID,start minute,end minute,required participant IDs]
- [["A",900,960,["Sam"]],["B",950,1000,["Sam","Jo"]],["C",1005,1030,["Jo"]]]
- Required travel buffer between any shared-person events (min)
- 10
- Collision pairs [event1,event2,shared participants,actual overlap min]
- [["A","B",["Sam"],10],["B","C",["Jo"],0]]
- Conflicting event-pair count
- 2
- Affected participants
- ["Jo","Sam"]
Try another scenario
- Events JSON [ID,start minute,end minute,required participant IDs]
- [["A",900,960,["Sam"]],["B",950,1000,["Sam","Jo"]],["C",1005,1030,["Jo"]]]
- Required travel buffer between any shared-person events (min)
- 0
- Collision pairs [event1,event2,shared participants,actual overlap min]
- [["A","B",["Sam"],10]]
- Conflicting event-pair count
- 1
- Affected participants
- ["Sam"]
Calculation method
Calculation method
Collision pairs [event1,event2,shared participants,actual overlap min]
For each input-order pair with shared participant, flag unless one end+buffer<=other start. Actual overlap=max(0,minEnds-maxStarts).
Conflicting event-pair count
Count pair flags once regardless of shared-person count.
Affected participants
Sorted unique participants across collision pairs.
Symbols and units
- a
- Events JSON [ID,start minute,end minute,required participant IDs]
- b
- Required travel buffer between any shared-person events (min)
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
- Fixed events on one weekly axis, uniform user travel buffer. A buffer-only conflict has actual overlap zero. No route inference or automatic rescheduling. Supported limits: 1..300 unique events; 0<=start<end<=10080 integer minutes; buffer>=0; unique participant IDs within event.
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.