hillclimb / problemsesc goes back
Example problems
Construction problems in one shape: the submission is a small CSV of numbers, the verifier checks the constraints and computes the score exactly, and there is no dataset, no hidden split and no noise. Each ships with the best known value as a reference line on the chart. hillclimb problem list prints this catalog; hillclimb problem get <id> copies one in. Every picture is a good construction, not the floor the search starts from.
Circle packing
Heilbronn triangles
heilbronn-11
11 points in the unit square; make the smallest triangle they span as large as possible.
heilbronn-14
14 points in the unit square; make the smallest triangle they span as large as possible.
heilbronn-17
17 points in the unit square; make the smallest triangle they span as large as possible.
heilbronn-convex-13
13 points in convex position; smallest triangle relative to the hull area.
Low-autocorrelation binary sequences
Tammes
Thomson
Autocorrelation inequalities
autocorr-1
A non-negative step function whose autocorrelation peak is small next to its mass.
erdos-overlap
A density on [0, 2] with mass 1 whose overlap with its own complement stays small under every shift.
Kissing configuration
kissing-11
Integer points in 11 dimensions, pairwise at least as far apart as the longest of them.
Golomb rulers
Travelling salesman
Multidimensional knapsack
mknap-100-5
100 items, each with a value and 5 weights; take the most value that fits all 5 capacities.
mknap-250-10
250 items, each with a value and 10 weights; take the most value that fits all 10 capacities.