I am considering the following two-player game:
Player 1 chooses a permutation of integers from $1$ to $N$.
Player 2 has to guess this choice.
At each step, he makes an attempt and Player 1 answers the number of correctly positioned numbers
I don't see how to compute the maximal number of needed attempt in the worst case (and if there is an explicit strategy) and the average number. Does this game has a known name, and is it studied somewhere?
Thanks in advance for your comments!