All challenges

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.

Recover a hidden bracket string through the original regular-substring query protocol.

Synthesize an AND/OR expression matching each supplied boolean truth table.

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

Recover a hidden permutation using interactive pairwise bitwise-OR queries.

Count binary substrings whose number of zeroes equals the square of the number of ones.

Recover a hidden binary slate string through the original Frontier-CS interactive machine.

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.

Find the unique diamond index in a Big Prize source instance.

Select big integers whose sum is as close as possible to the target.