The Heilbronn Problem (Erich Friedmann)	Discuss about this problem
How do you locate n points inside a unit square so that the area of the smallest triangle formed by 3 of these points is maximized? http://www.stetson.edu/~efriedma/heilbronn/ http://www.stetson.edu/~efriedma/heilcirc/ http://www.stetson.edu/~efriedma/heiltri/ See link. We can extend the problem upto 50x50 squares.