Navigation · Missions, Coverage and Fleets · M8-L1 · Intermediate
Order the Stops
06:30. The pharmacy has eight deliveries for Scout, and the wards phoned them in at random. Driven in that order, the route zigzags across the whole building and the first blood-sample kit arrives late.
You will write the greedy rule a first version of every fleet scheduler uses, repair its tour by reversing segments, and then compute the best possible tour for a short list to see how far the shortcuts are from it.
Your task
Lab complete: post-mortem
You have passed every stage. Now connect it back to the theory and move on:
Output
What Python can I use?
Plain Python with math and heapq. Your code runs in a background worker: an endless loop is stopped after a few seconds and the page stays usable. It runs in your browser and is never sent anywhere.