TechnicalApril 11, 2026 6 min
How the Cyno Assignment Algorithm Works
A transparent look at how COMPASS finds the globally optimal assignment of cyno characters to destinations using dynamic programming.
COMPASS doesn't greedily assign the best character to each destination. It considers all possible pairings simultaneously and minimizes total fleet disruption.
O(2ⁿ)
DP Bitmask
<100ms
6 Dests × 14 Chars
3
Route Types per Pair
The Pipeline
1
Route Calculation
For every character × destination, calculate 3 routes: Direct (gate travel), Jump Clone (activate + gate), Death Clone (self-destruct + gate). Each uses real EVE physics.
2
Travel Time
Real SDE data — not estimates. Align time from
ceil(ln(2) × inertia × mass / 500,000). Warp distance from actual gate xyz coordinates. Per-jump overhead: 20s fixed.3
Disruption Scoring
Each route gets a cost reflecting fleet impact. Clone options carry penalties for implant loss, cooldowns, reship time.
4
Optimal Assignment
DP bitmask solver tries every permutation efficiently. Finds the assignment that minimizes total disruption across ALL destinations at once.
Direct Travel
Fly through stargates from current location. Uses ESI shortest path. Best when character is close.
Jump Clone
Activate a jump clone near the destination, then gate the remaining distance. Subject to 24h cooldown.
Death Clone
Self-destruct to respawn at home station. Destroys active implants. Heavy penalty — last resort.