Most high school seniors spend their time stressing over college applications or varsity sports. Seventeen-year-old Connor Hill from Port Matilda, Pennsylvania, spent years writing complex code to tackle a math problem that had baffled professionals for decades.
His custom computer algorithm mapped every conceivable variant of a rare class of three-dimensional shapes known as noble polyhedra. By proving there are exactly two infinite structural families and 146 isolated examples of these complex shapes, Hill took home the top $250,000 prize at the Regeneron Science Talent Search.
If you think this sounds like standard high school science fair stuff, you're missing the point. This is pure, heavy-duty mathematics.
What Are Noble Polyhedra Anyway
To understand why Hill's algorithm matters, you have to look at the shapes themselves. A polyhedron is a three-dimensional object with flat faces and straight edges. Think of a standard cube or a pyramid.
A polyhedron earns the label "noble" when it achieves a very high level of symmetry. Every single face must share the exact same shape, and every corner vertex must maintain an identical arrangement of faces. While regular shapes like Platonic solids are simple, noble polyhedra get wild. They allow complex, self-intersecting geometries that make classification a nightmare.
Before Hill published his proof, mathematicians already knew about two infinite families and had manually confirmed 61 isolated examples by 2020. But nobody knew the full roster. Researchers suspected hundreds more might exist hidden behind tricky combinations of symmetry, yet manual tracking hit a dead end.
How the Algorithm Cracked the Code
Hill didn't just sit around sketching shapes on paper. He spent three years independently coding and refining a computer program to do the heavy lifting.
Writing code for geometry is tricky. Instead of forcing a computer to search through an infinite abyss of potential three-dimensional structures directly, Hill translated the geometric rules into algebraic equations, including complex polynomial equations.
This translation trick changed everything. By shifting the problem into a different mathematical framework, he shrunk an infinite headache down into a finite set of possibilities that a computer could systematically verify.
The path wasn't smooth. Hill hit walls where his code failed to scale, forcing him to completely scrap and rewrite his entire codebase multiple times. Persistence paid off. His final algorithm completed the exhaustive search and proved definitively that exactly 146 isolated noble polyhedra exist, alongside the two known infinite families.
Why This Breakthrough Goes Beyond Geometry
Winning a quarter-million dollars is a nice way to fund a college fund, but the real value here lies in the methodology. Hill's approach of breaking down a chaotic, sprawling problem into smaller, solvable mathematical components mimics techniques used in advanced scientific research.
Experts note that translating complex structural puzzles into algebraic equations shares DNA with how modern biomedical researchers study protein folding or how drugs interact with human cellular receptors. Hill hopes his computational framework can eventually transition into mapping compound polyhedral structures and interconnected networks.
He almost didn't even apply for the competition. Convinced nothing would come of it, a family friend in Pittsburgh eventually persuaded him to throw his hat into the ring for the Regeneron Science Talent Search. Out of thousands of applicants nationwide, his independent code cut through the noise and captured first place.
Complex problem-solving doesn't require a corporate laboratory or a massive research budget. Sometimes it just takes a teenager with a laptop, a stubborn refusal to quit, and an algorithm built from scratch.
