All challenges

Plan a closed patrol route that sees all road cells while keeping travel cost low.

Recover the binary grid from palindromic-path source data.

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

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

Construct a small binary grid with exactly the requested number of monotone paths.

Produce source-grid routes for noisy path-feedback instances.

Trap a moving robot on the grid through the original Frontier-CS turn-by-turn interaction.

Find a simple grid path that visits required row intervals in a valid order.

Transform a jelly matrix with swaps, rotations, and preset operations.

Plan fighter refueling, movement, and attacks to destroy valuable red bases.

Print an 8 by 14 digit grid that can read a long prefix of positive integers by adjacent walks.

Emit a deterministic tilt sequence for the candy board source instance.