All challenges

Place equal spheres in a unit cube to maximize the inferred common radius.

Construct a completely multiplicative +/-1 function with small prefix imbalance.

Choose relay stations and links to connect robots with low communication cost.

Design low-cost multi-cloud broadcast routes under throughput and bandwidth constraints.

Partition graph vertices into as few clique groups as possible.

Design a two-choice transition plan whose long-run visit counts match target cleaning duties.

Output a Hamiltonian tour under a periodic route penalty and improve over the monotone baseline.

Estimate the highlighted area swept by circular brush strokes along selected segments.

Rig and detonate bridges over several days to balance installation, blast, and harvest value.

Draw a bounded grid with the requested black and white component counts at low weighted area.

Assign facilities to locations to reduce binary flow-distance cost.

Design a bounded Sokoban layout with a solvable 2x2 box puzzle and large minimum distance.