All challenges

Transform one integer sequence into another with pair operations when possible.

Place communication hubs and assign sensors to minimize radius and load costs.

Navigate an infinite colored tree to the exit through the original interactive distance device.

Transform a sliding-vehicle puzzle to maximize the minimum solution length.

Pack rotatable unit squares in the smallest possible square container.

Select polygon vertex segments to minimize expected distance to the nearest installed rope.

Choose rooted trees in a planar graph to maximize weighted depth attractiveness under a height limit.

Choose a route string that still reaches the goal with high probability after omissions.

Build a bounded-size tree of small vertex sets that covers tree and outer-ring edges.

Select emitter ports in a circular resonator under budget to maximize saturated pair value.

Assign oscillators to distinct rail bays to maximize coupled resonance energy.

Report which roads are repaired in the source road-network instance.