#ThisWeeksFiddler, 20250207

This week the question is: Can You Bounce a Ball Like an AI?

… suppose you have a unit square that’s rotating about its center at a constant (nonzero) angular speed, and there’s a moving ball inside. The ball has a constant (nonzero) linear speed, and there’s no friction or gravity. When the ball hits an edge of the square, it simply reflects as though the square is momentarily stationary during the briefest of moments they’re in contact. Also, the ball is not allowed to hit a corner of the square—it would get jammed in that corner, a situation we prefer to avoid.

Suppose the ball travels on a periodic (i.e., repeating) path, and that it only ever makes contact with a single point on the unit square. What is the shortest distance the ball could travel in one complete loop of this path?

And for extra credit:

Again, you have a rotating unit square and bouncing ball inside.

By now, you’ve hopefully found the shortest repeating path for which the ball makes contact with a single point on the square. Let’s call this path length L1.

The next shortest repeating path for which the ball makes contact with a single point on the square has length L2. To be clear, L2 > L1.

What is the length L2?

Highlight to reveal (possibly incorrect) solution:

Spreadsheet.

Oh wait. While a unit circle has radius 1, diameter 2, a unit square simply has width 1, right? Sigh. — All results above should be divided by 2.

Skriv en kommentar