Rush Hour Puzzle
openTransform a sliding-vehicle puzzle to maximize the minimum solution length.
Transform a sliding-vehicle puzzle to maximize the minimum solution length.
Identify the hidden target from a noisy membership-search instance.
Track a hidden mole on a rooted tree through subtree queries that can move the target.
Recover a hidden unordered_set bucket count through the original collision-query protocol.
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.
Report the hidden line width from the RiOI editor source instance.
Find the singleton value through membership queries over a hidden shuffled multiset.
Find an adaptively hidden absent student despite bounded dishonest replies.
Find the hidden chord in a cycle by querying shortest-path distances.
Move numbered balls between three baskets under center-ball transfer rules.