Synthetic TSP sandbox
A fixed-seed abstract plane demonstrates combinatorial growth and two browser heuristics. It is not a geographic, personal, or operational planner.
For a symmetric TSP, fix the start vertex and identify a tour with its reverse. For n ≥ 3, that leaves (n−1)!/2 undirected tours. The two-vertex closed route is handled as one special case.
Ten vertices give exactly 181,440 tours. Twenty-five give about 3.1022 × 10^23; fifty give about 3.0414 × 10^62. The underlying integer counts use exact factorial arithmetic; the displayed scientific notation is truncated to five significant digits.
The browser starts from the deterministic synthetic fixture, chooses a nearest-neighbor route, and applies bounded 2-opt improvement. Moving a waypoint recomputes that heuristic; it does not execute the Rust solver or inherit a Lean theorem.
Ordering uses deterministic nearest-neighbor selection inside the synthetic fixture. It is illustrative output, not an optimized or verified field plan.
The pinned corpus contains named shortcutting and crossing-exclusion declarations with explicit hypotheses. This page supplies no claim that its synthetic generator, nearest-neighbor ordering, or 2-opt canvas is extracted from or certified by those declarations.