Cook's Ruler Sweep: 10k-City Tsp in 17 Minutes (pure Python)
Postedabout 1 month ago
github.comTechstory
excitedpositive
Debate
0/100
AlgorithmPythonTsp
Key topics
Algorithm
Python
Tsp
A Python implementation of Cook's Ruler Sweep algorithm solving a 10k-city Traveling Salesman Problem in 17 minutes.
Snapshot generated from the HN discussion
Discussion Activity
Light discussionFirst comment
N/A
Peak period
1
Start
Avg / period
1
Key moments
- 01Story posted
Nov 19, 2025 at 2:44 PM EST
about 1 month ago
Step 01 - 02First comment
Nov 19, 2025 at 2:44 PM EST
0s after posting
Step 02 - 03Peak activity
1 comments in Start
Hottest window of the conversation
Step 03 - 04Latest activity
Nov 19, 2025 at 2:44 PM EST
about 1 month ago
Step 04
Generating AI Summary...
Analyzing up to 500 comments to identify key contributors and discussion patterns
ID: 45984131Type: storyLast synced: 11/19/2025, 9:23:53 PM
Want the full context?
Jump to the original sources
Read the primary article or dive into the live Hacker News thread when you're ready.
No training, no compilation, no external solvers. Just geometry and a 1.3× tolerance band.
I built it in a 72-hour rage after hitting a wall trying to optimize an app I'm building for my cybersecurity startup.
https://github.com/g4mbit5/Cooks-Ruler-Sweep