On a billiard table of 1 by 2 meters lies a billiard (snooker) ball, with a diameter of 52.5 mm, separate from the sides. It is pushed away without effect and then it rolls 3 meters. How many times could the sides of the table have been hit at the most?

  • $\begingroup$ What are "normal dimensions" for a "billiard ball" ? E.g. Snooker balls are 52,5mm large and International Pool balls are 57.15mm. I don't think that makes a big difference, but can you fix a value in the question so that everybody goes by the same figure ? en.wikipedia.org/wiki/Billiard_ball $\endgroup$
    – Evargalo
    Oct 12, 2020 at 9:24
  • 3
    $\begingroup$ You probably want to ask: how many times can it hit a side. Now the answer is i.m.o. 4 (all sides), you are probably asking for a higher number. $\endgroup$
    – Retudin
    Oct 12, 2020 at 9:56
  • 1
    $\begingroup$ I believe it is a diameter of 52.5mm, not a radius. $\endgroup$
    – IronEagle
    Oct 12, 2020 at 22:42
  • $\begingroup$ A real billiard ball picks up a little side spin when it hits a cushion obliquely, but the geometry tag probably means the sides just reflect the path? $\endgroup$
    – Bass
    Oct 15, 2020 at 9:50

3 Answers 3


Here is a path that touches

5 sides:
billiard table with path that touches 5 sides

You can calculate the length of this path as follows:

The length of the two long lines is $\sqrt{2}\approx 1.4142$, and the short lines can be made arbitrarily short, so the total length is a little bit more than $2\sqrt{2}<3$.

To solve this kind of problems, you can

draw a grid of rectangles of size $2\times 1$, and try to draw a straight line of length $3$ that intersects as many grid lines as possible. With the help of a comment by @boboquack, the problem can be stated more rigorously. Starting from a corner is optimal (see proof below), so we may start at $(0,0)$:


We have $x^2+y^2=9$, so $y=\sqrt{9-x^2}$. The number of vertical grid lines that our red line intersects is $\lceil x \rceil$. The number of horizontal grid lines that our red line intersects is $\lceil y/2 \rceil$. Therefore, we to find the best path, we have to solve the following optimization problem: $$\max_x \left(\lceil x \rceil+\left\lceil \frac{\sqrt{9-x^2}}{2} \right\rceil\right).$$ This is easy to solve by trying the few reasonable options for $x$, which are the integers $0, 1, 2, 3$ plus or minus a small $\epsilon\ge 0$. The maximum of 5 edges touched is achieved when $x=2+\epsilon$.

Proof that

starting at a corner

is optimal (also contributed by @boboquack):

Consider an arbitrary (red) line of length $3$ in the grid. Let $a$ and $b$ be the distances from each of the two ends of the line to their closest horizontal grid line. Pick the smallest of $a$ and $b$, and translate the red line vertically by that amount towards the corresponding horizontal grid line. Clearly, this translation does not change the number of intersected vertical grid lines, and it does not reduce the number of intersected horizontal grid lines. Then apply the same procedure horizontally, which also does not reduce the number of intersected grid lines. Now you have a red line that starts at a corner and has at least as many grid intersections as the original line. Therefore, starting at a corner is optimal.


This answer assumes a point-sized ball, as the size of the ball was not explicitly stated. With a big enough ball, more sides are possible (for example, a ball with $0.99$ m diameter can touch at least $100$ sides!).

  • 1
    $\begingroup$ (rot13) N gurbergvpny onyy jvgu n 0.99z qvnzrgre jbhyq abg gbhpu zhygvcyr fvqrf, ng yrnfg abg cebcreyl. Fvapr vg vf fb zhpu uvture guna gur fvqrenvy bs n fgnaqneq fabbxre gnoyr, vg jbhyq yvxryl ebyy evtug bire naq bss gur gnoyr. $\endgroup$ Oct 12, 2020 at 18:01
  • 1
    $\begingroup$ @Presser Gur urvtug bs gur gnoyr obeqref jnf abg fcrpvsvrq rvgure ;) Ohg lrf, vg frrzf gung gur onyy fvmr qbrf abg unir znal punaprf bs vainyvqngvat zl nafjre. Gur gevpx jvgu gur ubyrf va gur bgure nafjre zvtug gubhtu. $\endgroup$
    – wimi
    Oct 12, 2020 at 18:15
  • 1
    $\begingroup$ V oryvrir lbh pna nethr gung vs lbh pna npuvrir a obhaprf, lbh pna nyfb npuvrir a obhaprf jura gur onyy fgnegf neovgenevyl pybfr gb n pbeare. Gura qbvat gur erpgnatyr guvat jvgu n pbeare neovgenevyl pybfr gb gur bevtva, lbh pna pbafvqre gung gur ahzore bs obhaprf gb nabgure cbvag vf "prvy k cyhf prvy unys l" (gur ahzore bs iregvpny yvarf bs gur sbez "k rdhnyf vagrtre" cyhf gur ahzore bs ubevmbagny yvarf bs gur sbez "l rdhnyf gjvpr na vagrtre"), naq gura pbafvqrevat "gur pvepyr jvgu enqvhf guerr pragerq ng gur bevtva" naq qenjvat gung tvirf gung guvf vf znkvznyyl svir. $\endgroup$
    – boboquack
    Oct 13, 2020 at 9:16
  • $\begingroup$ What led me onto the train of thought that became my answer was looking at your diagram and thinking rot13("Gung cngu jbhyqa'g jbex - gur onyy jbhyq or cbggrq va gur zvqqyr cbpxrg!") $\endgroup$
    – Steve
    Oct 13, 2020 at 9:48
  • $\begingroup$ @boboquack Fb V thrff lbh zrna "fbyir gur bcgvzvmngvba ceboyrz znk prvy(k)+prvy(fdeg(9-k^2)/2)", juvpu frrzf rnfl rabhtu ol gelvat gur srj ernfbanoyr bcgvbaf sbe k (v.r., vagrtref 0, 1, 2, 3 cyhf/zvahf n fznyy rcfvyba). Fbhaqf yvxr n tbbq nccebnpu, lbh zvtug jnag gb cbfg gung nf na nafjre... $\endgroup$
    – wimi
    Oct 13, 2020 at 9:49

The answer depends critically on how you define a "side".

If we assume the table has 4 sides, then it's easy to find many paths that allow the ball to touch all 4 (which is what the question was asking at the time of posting this answer).

Instead, I shall interpret "side" as meaning "cushion", of which the table has 6.

Under this definition, a path that touches

all 6 sides

is possible. This is a minor adjustment of @wimi's answer - illustrative diagram of the path of the centre of the ball to achieve this:

Path of ball touching 6 sides
In this path, the ball first bounces off two cushions near a corner, then the corners of two cushions near the middle pocket (as question specified a normal sized ball and a billiard table, the normal shapes of cushions seem implicit!), and finally the other two cushions that are near the next corner.
Long diagonals each have a length somewhat less than $\sqrt2$, leaving plenty for the shorter segments out of the budget of 3.

If multiple hits on the same "side" are to be totalled, as the now modified question asks, the answer can become

much larger - depending on the relative size of the ball and the gap between the cushions on the corner pockets - the ball can bounce between them several times... illustrative example:
Path of centre of ball bouncing between corner cushions
As we only know the size of the ball, and not the size and shape of the gap between the cushions, there is no well-defined answer. On a professional table, with just the right trajectory, the ball can bounce many times in a corner like this without rolling very far. It is not uncommon to see this when a professional snooker player "just misses" a pocket for example, and the ball bounces back and forth many times, coming to rest directly in front of the hole, or in other cases (such as the illustrative path above), bounces a few times before rolling away from the pocket.

According to Wikipedia

"The pockets are around 86 mm (3.5 in),[clarification needed] though high-class tournaments may use slightly smaller pockets to increase difficulty"
so that's roughly 30mm larger than the ball.
A ball that rolls for 3m with most of that rolling being bouncing back and forth between the sides of the pocket without quite falling in would hit the sides a total approaching 100 times.


In my other answer I take advantage of the unstated properties of a billiard or snooker table, i.e.

The sides are not straight lines, but curve round towards the pockets, providing a possibility to bounce at different angles. However, this answer cannot be rigourously defined due to its critical reliance on the precise form of the cushions near the corners.

@wimi's answer considers

a point sized ball (despite the question always explicitly stating it was "normal dimensions", and later giving an exact dimension), and a table with no pockets at all.

I believe the intended answer is probably

5 bounces, with a path like this: (illustrative diagram, not to scale)
enter image description here
This path avoids the pockets, and also works only due to the ball having a non-zero diameter.

First, it is important to note that the ball was explicitly stated to be "with normal dimensions" even in the first version of the question, and later clarified to specify a diameter of 52.5mm. Therefore this invalidates

an answer whose proof of optimality relies on a horizontal path of 3 metres containing at most 3 bounces.

Whilst @wimi's answer also notes that

A ball of size 0.99m on a 1m table with sides at least 0.5m tall would bounce 100 times, this is also well outside the parameters of the question. A ball of normal dimensions (later clarified as 52.5mm, but for the accuracy needed I'll call it 0.05m) can bounce 4 times with some spare.

A grid similar to the one used in @wimi's answer can be constructed,

but the grid elements should be rectangles of dimension 0.95m x 1.95m, and not 1m x 2m, as the diameter of the ball should be subtracted from each consecutive pair of grid-lines.

It is also necessary for the path to avoid pockets, so these can be marked on the grid too, giving something like this:

grid with 3m path marked
The 3m path (marked in red) is intended as equivalent to the illustrative one drawn on the previous diagram above, but this time drawn approximately to scale. Each bounce of the ball from a side is represented by the red line crossing one of the black lines. None of these bounces are near a pocket (black circles).
There is some flexibility to move this path a bit in order to trade off how close to the corner pockets it gets vs how far from the edge it starts. The illustrated path is intended to show the case where the ball starts with about a 0.04m gap to the first side, and ends a similar distance to the final side. The bounces near the corner pockets are at a point where the ball is around 0.10m from the bottom cushion, so well clear of the pocket.

Re-checking @wimi's proposed answer on this new grid

It can in fact be adjusted to avoid the pockets by a similar margin. The green line (blue on the illustrative not-to-scale diagram on the right) is an example of an appropriately scaled 3m path that avoids the pockets while basically following the path that @wimi proposed:
Diagonal path added illustrative diagram of diagonal path avoiding pockets

  • $\begingroup$ At the point I started writing this answer, I thought its assumptions invalidated more of the answer from @wimi than they actually do. Instead, it would probably be better suited as an addendum to that answer rather than a completely separate answer. I'll look to re-draft it to do that later. $\endgroup$
    – Steve
    Oct 20, 2020 at 8:52

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.