George Rebane
This little puzzle recently came to my attention. A ring of radius R is tossed randomly onto a large grid of unit squares as shown below. The toss will score only if the ring intersects two or three squares โ rings 1 and 2 will score. If the ring intersects only one or more than three squares, it will not score โ rings 3 and 4 will not score. What radius ring will maximize the probability of scoring โ i.e. compute the radius and the maximum probability?
Being able to solve ‘puzzles’ such as this is a skill fundamental to solving several large classes of problems in science and engineering. And coming up with just the approach to its solution is a critical thinking skill that should make non-techies proud. TechTest season is again upon us, and I gave this problem to one of the very busy students I have been mentoring. He saw the challenge immediately, went home but couldnโt put it down, and had the correct answer back to me before sunset. I thought some of our RR readers might also want to take a crack at it, or give it to their bright offspring ๐
[30dec17 update] Thanks to Mr Don Carrera of Irwin, PA for his detailed workout of the problemโs solution. In subsequent private communications I promised to make available to readers both his solution and mine in PDF formats. Mr Carrera has also demonstrated that his solution and mine produce identical numerical results. Here are the downloads for Mr Carrera’s solution, and my solution.



Leave a comment