All challenges

Shift rows and columns to remove demons while preserving fortune pieces.

Output a fixed-length graph walk visiting every clearing while delaying valuable first visits.

Select a large independent set for an undirected graph.

Select a large clique in an undirected graph.

Assign Boolean variables to satisfy as many two-literal clauses as possible.

Optimize a Boolean assignment for a medium three-literal CNF instance.

Partition graph vertices to maximize crossing edges.

Move a two-leg Manhattan compass among pinholes to collect value under equal-distance moves.

Output a long common subsequence of two strings.

Assign Boolean variables to satisfy as many three-literal clauses as possible.

Construct a long non-revisiting knight path from a requested start square.

Print a connected acyclic grid map that resists gathering agents under random moves.