The Query Complexity of a Permutation-Based Variant of Mastermind

We study the query complexity of a permutation-based variant of the guessing game Mastermind. In this variant, the secret is a pair (z,π) which consists of a binary string z ∈ 0,1n and a permutation π of [n]. The secret must be unveiled by asking queries of the form x ∈ 0,1n. For each such query, we are returned the score [ fz,π(x):= max i ∈ [0..n]mid forall j ≤ i: zπ(j) = xπ(j),;] i.e., the score of x is the length of the longest common prefix of x and z with respect to the order imposed by π. The goal is to minimize the number of queries needed to identify (z,π). This problem originates from the study of black-box optimization heuristics, where it is known as the textscLeadingOnes problem. In this work, we prove matching upper and lower bounds for the deterministic and randomized query complexity of this game, which are Theta(n log n) and Theta(n log log n), respectively.