Grok 4.7 in Cursor yields numerical candidate for open sphere-inspection problem
xiaosun86 · x · 2026-10-03
- A user generated a numerical candidate for the shortest flight path around a unit spherical planet from which every surface point becomes visible, using Grok 4.7 inside Cursor.
- This relates to Zalgaller's sphere-inspection problem (1992), which remains open in general — the result is a numerical candidate, not a proof.
More from Fun
- Dataviz blackpill: AI helps people build imagined charts faster — and discover they're useless sooner — paul_cal · 2026-10-03
- Code Art Piece Low Water Protocol Uses Rule 110 and Conway's Life — paulfinneyx · 2026-10-03
- Dev adds Hulk, Bender and Peter Griffin to browser-based WoW — djcows · 2026-10-03
- AI Influencers Are Inevitable: Dirt-Cheap to Mass-Produce, Brands Will Pay — eptwts · 2026-10-03
- Musk on compute scaling: sufficient quantity is a quality all its own — XFreeze · 2026-10-03
- GYOKO DRIFT: free browser drift-racing game about hauling fish goes viral via three.js — gaganghotra_ · 2026-10-03