no. 16 · Tuesday 17 November 2026
One Shot, Twenty-One Balls: A Computer-Assisted Proof of a Single-Stroke Total Clearance in an Idealized Model of Snooker
Abstract
Snooker folklore holds that no single stroke can pocket all twenty-one object balls. We examine the claim in an explicit model: twenty-two equal disks on a rectangle with six pocket points, under constant rolling deceleration, frictionless collisions with normal restitution, and lossy specular cushions. We exhibit a configuration and a stroke, and prove in interval arithmetic that every stroke in an explicit box around it pockets all twenty-one object balls, so the set of successful strokes has positive measure. That set is a ribbon: every speed from 9.3214 to 12 m/s works, while the certified window of directions is 9.481e-43 radians wide, a number explained by a first-order analysis of twenty near-grazing collisions. A second configuration, a near-frozen cluster, has a certified window 9.4e-4 radians wide, thirty-nine orders of magnitude wider; its certificate uses Taylor models of degree six. The strokes with a given list of events form a semialgebraic set, and the endpoints of the windows are algebraic points of the circle. For the regulation opening position we state the corresponding conjecture, and show that if it holds with a regular witness then a finite certified search establishes it.
- comments
- 27 pages, 3 figures, 3 tables. v3: the certificates of Theorems B to E are regenerated after a correction to the precision handling of the certifiers; the cluster's window is certified over an interval of speeds; several definitions and statements are made precise. Code, data and certificates: https://github.com/avnerkantor/one-shot-twenty-one-balls (doi:10.5281/zenodo.24246108)
- fields
- Dynamical Systems