跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2607.12995 · v3

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

首次提交 2026-07-15 01:47
版本更新 2026-11-16 01:01
雷达观测 2026-11-17 17:12
arXiv ↗PDF ↗

摘要

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.

作者备注: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)

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-16 01:01 · 最新观测版本

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

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.

查看此版本解读 →查看此版本原文 ↗