Heilbronn triangles in the unit square

noneFor n points in a square of side length one, find the three points that make the triangle with minimal area. Finding the placement of n points that produces the largest such triangle is known as the Heilbronn triangle problem. The point placements within this Demonstration are the best known. Minimal triangles are colored red. All solutions above 12 points are due to Mark Beyleveld and David Cantrell, with optimization and exact solutions found by MathematicaComponente Curricular::Ensino Fundamental::Séries Finais::Matemátic