TSP Bruteforce

Enumerate Tours

Enumerate tours with fixed start city A. This is a small deterministic example, not solver engineering.

Example

Enumerate tours with fixed start city A.

highlighted = computed this step

Step 1 — Fixed start

Set up the exact small combinatorics values.

startA\begin{array}{c|c}\text{start}&\text{A}\end{array}

Step 2 — Tour

Compute the highlighted combinatorics value.

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

Step 3 — Tour

Compute the highlighted combinatorics value.

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

Step 4 — Tour

Compute the highlighted combinatorics value.

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

Step 5 — Tour

Compute the highlighted combinatorics value.

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

Step 6 — Tour

Compute the highlighted combinatorics value.

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

Step 7 — Tour

Compute the highlighted combinatorics value.

tour(A, D, C, B, A)\begin{array}{c|c}\text{tour}&\hlmath{\text{(A, D, C, B, A)}}\end{array}
combinatorics-search Every row is intentionally ordered and pinned to the lesson specification.