One Shot, Twenty-One Balls: A Computer-Assisted Proof of a Single-Stroke Total Clearance in an Idealized Model of Snooker

summary

The gist

One stroke can pocket all twenty-one object balls in an idealized model of snooker, and this successful set has a positive Lebesgue measure in the natural shot space pg1.

In short

The paper proves that a single shot can pocket all twenty-one object balls in an idealized snooker model. It constructs a mathematical model showing this outcome has positive measure, meaning it is not a fluke of zero probability. However, the set of such shots is unobservably small due to rapid decay, creating a gap between mathematical possibility and physical reality.

Key concepts

Positive Lebesgue Measure
This mathematical concept indicates that the set of successful shots leading to twenty-one pockets occupies a genuine volume in the shot space. It means there are infinitely many such shots clustered together, not just isolated points, suggesting the clearance is mathematically possible within the model.
Witness Configuration
A witness is a specific, verified configuration and shot that achieves the desired outcome—pocketing all twenty-one balls in one stroke. The paper constructs this using a single chain of collisions where every ball ends up in its target pocket, proving the clearance is physically achievable.
Measure Zero vs. Unobservably Small
This distinction highlights the core finding: while the set of successful shots has positive measure (mathematically possible), it is 'unobservably small' because sensitivity compounds multiplicatively. This means that although a clearance exists mathematically, its practical existence for a human player is negligible.
Model M
This is a fully explicit mathematical model used to simulate the physics of the billiard table. It precisely defines table dimensions, ball sizes, and the rules governing collisions like deceleration and friction. This rigorous model allows the authors to prove existence and analyze shot dynamics.

Terminology used across episodes

This episode discusses

The paper

One Shot, Twenty-One Balls: A Computer-Assisted Proof of a Single-Stroke Total Clearance in an Idealized Model of Snooker · Read on arXiv

Israel Central Bureau of Statistics

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.3213 to 12 m/s works, while the certified window of directions is 9.4813e-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 numbers. 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.

Transcript

Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.

Tom: We're looking at the paper: "One Shot, Twenty-One Balls".

Jane: Here's the gist of the paper. One stroke can pocket all twenty-one object balls in an idealized model of snooker, and this successful set has a positive Lebesgue measure in the natural shot space pg1.

Tom: This finding is significant because it shows that while a total clearance is not a fluke of measure zero, it occupies genuine volume in the shot space pg1.

Jane: The Mathematical Model The authors construct a fully explicit model called Model M to analyze billiard dynamics pg3.

Tom: This model specifies the table dimensions, ball radii, and the dynamics between events such as deceleration and collision laws pg3.

Paper summary: Tom: The paper "One Shot, Twenty-One Balls: A Computer-Assisted Proof of a Single-Stroke Total Clearance in an Idealized Model of Snooker" shows that total clearance is possible in this idealized model and forms a set with positive Lebesgue measure >

Jane: They prove it using a computer construction to establish the existence of these margins and show that total clearances are not just random events with zero measure >

Lu: The implication for theoretical work is pointing that tradition at a bar bet, showing how the mathematical framework can guarantee things that are otherwise just folklore or intuition >

Conclusion: Tom: So we're wrapping up this look at the paper "One Shot, Twenty-One Balls: A Computer-Assisted Proof of a Single-Stroke Total Clearance in an Idealized Model of Snooker." Basically, they’ve used a computer to prove that in this idealized snooker model, you can pocket all twenty-one object balls with just one stroke.

Meng: And from my side, I see the issue immediately. The paper mentions that while the set of shots leading to twenty-one balls has positive measure, the actual neighborhood around that successful shot is "extraordinarily thin." It's like trying to hit a needle in a haystack when the needle exists somewhere in that hay >

Lalam: That’s exactly what they’re pointing out. The mathematical work guarantees those margins exist at all, but for twenty-one balls, those margins are so fine they can't be seen or played by a human cue ball with any realistic precision >

Jane: So the authors are essentially saying that trick-shot artists operate in this weird middle ground between something that is mathematically real and something that is physically unobservable.

Tom: Exactly. The paper doesn't claim it’s a "holy grail" of snooker; they’re just showing that the mathematical structure allows for it. It turns the conversation around from "Can this be done?" to "How small does it have to be to be real?"

Lu: And they set up some serious follow-up work on that. They suggest looking at subset simulations, where you check if you can get one or two balls, then three, and so on. If they can find a way to prove the decay law holds better for smaller numbers, that would give us more hope about the scaling >

Meng: From an engineering view, I'm interested in how much computational power it takes to actually verify those witness shots they built. It seems like the construction itself is very sensitive, so verifying it at this level requires a lot of computation >

Jane: It’s interesting because it shows that sometimes the most important part of a math paper isn't just the big result, but how they frame the limits and what comes next for real-world application. The question becomes whether we can bridge that gap between theory and physics.

More episodes

← Home