TSP Bruteforce

Choose Shortest Tour

Choose the canonical first tour among minimum-cost tours. This is a small deterministic example, not solver engineering.

Example

Choose the canonical first tour among minimum-cost tours.

highlighted = computed this step

Step 1 — Minimum cost

Compute the highlighted combinatorics value.

minimum cost15\begin{array}{c|c}\text{minimum cost}&\hlmath{\text{15}}\end{array}

Step 2 — Chosen tour

Compute the highlighted combinatorics value.

chosen tour(A, B, C, D, A)\begin{array}{c|c}\text{chosen tour}&\hlmath{\text{(A, B, C, D, A)}}\end{array}

Step 3 — Verdict

Compute the highlighted combinatorics value.

verdictshortest canonical tour\begin{array}{c|c}\text{verdict}&\hlmath{\text{shortest canonical tour}}\end{array}
combinatorics-search Every row is intentionally ordered and pinned to the lesson specification.