Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Given a square piece of property of unit side you wish to build fences so that it is impossible to see through the property, ie there is no sightline connecting two points outside the property and passing through the property that does not intersect a fence. The fences do not have to be connected and several fences can come together at a point. What is the minimum total length of fencing required and how is it arranged. For example you could place fencing along all four sides. This would have total length 4 but is not the best possible.
I do not have a proof that my answer is minimal. I will accept as correct any answer that does at least as well.
UPDATE, 7/12/07: The fences can be placed in the interior of the property, they aren't restricted to the boundary.
We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!
We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com
Ponder This Solution:
Suppose the corners of the property are at (0,0), (1,0), (1,1) and (0,1). The best solution known to me is the following. Connect the point (.5-sqrt(3)/6,.5-sqrt(3)/6) by straight fences to the corners (0,0), (1,0) and (0,1). Connect the point (.5,.5) to the corner (1,1) with a straight fence. The total length is 2*sqrt(2/3)+(sqrt(2)/2 - sqrt(6)/6)+sqrt(2)/2 = (2/3)*sqrt(6)+(sqrt(2)/2)-sqrt(6)/6+sqrt(2)/2 = sqrt(2)+sqrt(6)/2 = 2.638958433764684+.
A version of this problem appeared in the January 1983 issue of the "Tentacle" an internal Lawrence Livermore National Laboratory publication (p. 30 "Puzzles by Henry Larson" edited by Harry Nelson). I learned of it from John Fletcher.
Thanks to some of the solvers for pointing me to additional appearances of this problem. The earliest I found was:
R. E. D. Jones, "Opaque Sets of Degree alpha", American Mathematical Monthly, May 1964, p. 535-537.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com