Back in the day, I used to post math puzzles, similar to how I post origami today. Today I’m revisiting a problem that I never fully solved.
Problem statement: There is a square patch of grass, with sides of unit length. Using the shortest length of fence, block all straight paths that cut across the grass.
I did not create this puzzle, but I am not sure of its original source. The riddle once appeared on the (now defunct) wu : riddles website, under the title “Samwise and Gandalf”. In this version of the puzzle, Lord Sauron has an underground telephone line that cuts a straight line somewhere through a square plot of land. Samwise doesn’t know where it is, so he intends to uncover it by digging up the perimeter. But Gandalf tells him that there is a more efficient solution. What’s the best Sam can do?
The impressive thing about this puzzle is that you can go through many iterations of finding better and better solutions. Afterwards, we’ll consider a hexagonal patch of grass, and other shapes.


