An unlucky gardener planted a 10x10 square array of 100 old seeds out in the garden. Only 5 of these seeds have germinated including one at the southwest corner (0,0) where a slug is currently reducing it to ground level.

When it finishes it will head directly to the next closest doomed plant. After it eats that one it will again leave a slime trail to the closest remaining plant and so on until the garden is no more.

Where are the 4 remaining seedlings if the path crawled by the slug is the longest possible and it never has to choose between two equidistant snacks?

Note: Although the slug will never have to choose between two equidistant seedlings, this doesn't imply that no two are equidistant.

Next find the locations if 6 seedlings had germinated instead of 5.

(In reply to re: My solution for 5 seeds by Jer)

My bad.. By moving from 0,0 to 7,7 and to 10,10-e where e=epsilon that can be defined to be infinitly close to zero. That way there would be nothing to choose from and the path would still be almost as long as it used to be..

Posted by atheron on 2006-06-25 14:23:07