Can AI Find the Shortest Paris Sightseeing Route

Archived study

Saves a fixed Paris landmark order before comparing it with nearest-neighbor, 2-opt, and exhaustive route search. Coordinates, route tables, and a map document the straight-line-distance comparison.

Interpretation and limits

The optimization fixes the start, finish, and eight intermediate stops. Straight-line distance excludes streets, queues, accessibility, and traffic, so the output is not a live walking itinerary.

Package and provenance

The original .science export and matching poster are preserved byte-for-byte from the upstream case. The package contains the conversation, session metadata, and the resources inventoried in its internal manifest. This introduction summarizes the archived record; the research, external sources, and model evaluations were not rerun for this import.