From c562e477aa37e19c8ba51231861a1806ab2d77e4 Mon Sep 17 00:00:00 2001 From: Peter Norvig Date: Sun, 7 Dec 2025 09:58:48 -0800 Subject: [PATCH] Update TSP.ipynb --- ipynb/TSP.ipynb | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/ipynb/TSP.ipynb b/ipynb/TSP.ipynb index e579ebd..f1e2efe 100644 --- a/ipynb/TSP.ipynb +++ b/ipynb/TSP.ipynb @@ -31,10 +31,10 @@ "\n", "|   |   |\n", "|--------|--------|\n", - "|*Given a **set of cities***|I'll represent them with a set of points in the (*x*, *y*) plane|\n", - "|*and the **distance** between each pair of cities*,|I'll define a function `distance(A, B)`|\n", - "|*what is the **shortest***| I'll use `shortest(tours)` to find this, and `tour_length(tour)` to compute the length of each candidate tour.|\n", - "|***tour***|A **tour** will be represented by a list. `[A, B, C]` is the tour from `A` to `B` to`C` and back to `A` . |\n", + "|*Given a set of cities*|I'll represent them with a set of points in the (*x*, *y*) plane|\n", + "|*and the distance between each pair of cities*,|I'll define a function `distance(A, B)`|\n", + "|*what is the shortest*| I'll use `shortest(tours)` to find this, and `tour_length(tour)` to compute the length of each candidate tour.|\n", + "|*tour*|A **tour** will be represented by a list. `[A, B, C]` is the tour from `A` to `B` to`C` and back to `A` . |\n", "|*that visits each city exactly once, and returns to the starting city?*|The function `valid_tour(tour)` will check this.|\n", "\n", "Four more basic concepts, implied by the definition:\n",