hillclimb.shesc goes back
heilbronn
n points in the unit square; make the smallest triangle they span as large as possible. The catalog carries 11, 14 and 17; the points input takes any n from 3 to 34. This is the problem by hand: what a search moves, you move.
Drag a point. The shaded triangle is the smallest one, the score. Arrow keys nudge the selected point, ⌘Z undoes.