SearcharxivSearch

arXiv · 2607.12995

One Shot, Twenty-One Balls: Existence and Rarity of a Total Clearance in a Single Stroke of Snooker

Abstract

Snooker folklore holds that no single stroke can pocket all twenty-one object balls. We examine the claim in an idealized but fully specified model of billiard dynamics. Within the model we exhibit an admissible configuration of the twenty-two balls and a stroke of the cue ball that pockets all twenty-one object balls, and we show that the set of such strokes has positive Lebesgue measure in the natural shot space: total clearances are not flukes of measure zero but open events. For the regulation opening configuration we conjecture the same and explain both why a simulation cannot settle the conjecture by brute force and what kind of computation could settle it in principle. Monte Carlo experiments in the same model estimate the probability P(k) that a uniformly random stroke pockets exactly k balls; the observed decay of P(k), extrapolated conditionally on the conjecture, places the probability of a total clearance from the break far beyond anything observable. The folk claim is thus right in practice and wrong in principle, and the gap between the two is exactly the distance between measure zero and unobservably small.

Explore related subjects

Keep this discovery

BibTeXRIS

Avner Kantor. 2026-07-14. One Shot, Twenty-One Balls: Existence and Rarity of a Total Clearance in a Single Stroke of Snooker. https://arxiv.org/abs/2607.12995

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG