The Shortest-Splitline Algorithm: a Gerrymandering Solution [Bonus Video]
Overview
A short CGP Grey bonus video explaining the shortest-splitline algorithm, which draws electoral districts by repeatedly splitting a state along its shortest dividing line while balancing population. It is offered as a neutral, algorithmic fix for gerrymandering.
On Hacker News
Cited as the standard example of algorithmic redistricting when gerrymandering and electoral reform come up.
Topics
Sources
Video by CGP Grey, played through YouTube.
Data and selection notes
HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.
HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.
Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.
Selection checks
- SaaS & AI candidates: Topic keywords do not match
- Editor-approved picks: Editorial review is required
What people said