How it works
The start is fixed at input index 0. Completed Held–Karp search certifies the numerical optimum for at most 13 points; larger instances use nearest-neighbour construction and bounded 2-opt improvements. A cooperative time budget and deterministic work budget limit the search. Every returned tour is complete.
Inputs and units
Supply 2–256 points with metric euclidean_km and x/y in kilometres, or great_circle_km and lat/lon in degrees. The spherical radius is declared as 6371.0088 km. Choose whether to return to the start and a 100–10000 ms time budget.
What the result contains
The complete order and every leg, total geometric distance, exact flag, method, stopping reason, nearest-neighbour reference, work count and measured native time. The optional route-risk chain verifies the legs before converting them to whole-minute durations using a supplied speed.
Example MCP call
{
"name": "route_optimizer",
"arguments": {
"metric": "euclidean_km",
"points": [
{
"x": 0,
"y": 0
},
{
"x": 1,
"y": 0
},
{
"x": 1,
"y": 1
},
{
"x": 0,
"y": 1
},
{
"x": 0.5,
"y": 0.5
}
],
"return_to_start": true,
"time_budget_ms": 1000
}
}Send this tool name and arguments through a connected MCP client. Discover the authoritative input schema with tools/list.
Execution and availability
ScoreCompute exposes this tool through MCP Streamable HTTP. Rust computation runs on a connected worker; the public website and MCP gateway run separately. Among these thirteen scientific tools, CUDA is implemented for simulate_pi; the other engines currently run on CPU. The separate contributor pilot has its own fixed integer Monte Carlo workload. Requests are bounded and concurrent work may be refused when capacity is occupied.
Record inputs, assumptions and returned provenance when sharing a result. The public observatory displays software client names and tool activity, without publishing calculation arguments or results.