All challenges

Reconstruct the hidden graph used by triple-edge-count queries.

Predict an interactive wager stream while competing against the best hidden participant.

Emit the static reference token for the graph-game migration payload.

Recover a hidden tree through triple-node median queries.

Recover the hidden pair of positions from the source answer metadata.

Find the hidden pair associated with the large integer source instance.

Determine a hidden cycle size through the original Frontier-CS walk-and-guess interaction.

Identify hidden AND/OR gates in a switch-controlled circuit.

Decide whether a hidden graph is bipartite using the original edge-count query protocol.

Report cycle lengths of functional graphs from hedgehog source instances.

Compute the total weight in a heap-indexed tree source instance.

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