Place 9 balls ("o") in the intersections of the grid below to achieve 10 straight lines, each line containing 3 and exactly 3 balls. You may assume, if you need, that each cell is a perfect square.

           +---+---+---+---+---+---+---+---+
           |   |   |   |   |   |   |   |   |
           +---+---+---+---+---+---+---+---+
           |   |   |   |   |   |   |   |   |
           +---+---+---+---+---+---+---+---+
           |   |   |   |   |   |   |   |   |
           +---+---+---+---+---+---+---+---+
           |   |   |   |   |   |   |   |   |
           +---+---+---+---+---+---+---+---+
           |   |   |   |   |   |   |   |   |
           +---+---+---+---+---+---+---+---+
           |   |   |   |   |   |   |   |   |
           +---+---+---+---+---+---+---+---+

The problem Tree planting exercise was not about this problem, however there was some discussion where the Leming solution was raised. 

In that discussion the issue of two and three trees per line was discussed.

Posted by brianjn on 2008-10-13 22:46:31