I have a question paper with $n$ True/False questions and I don't know the answer to any of those questions. My objective is to find the answer key of the question paper. All I have is a machine which will tell my total score out of $n$, when I submit my answer sheet(I must mark either T/F for all the questions). What strategy should I follow to ensure that I find the answer key in minimum number of submissions?
Is the above problem already known and solved?
PS: I am not really sure about the tags. Please edit them if they are wrong.
Yes, this has already been solved.
Think of this problem as a simple version of the MasterMind (code-breaker) game. In this simple version there are only 2 colors, black and white (true and false).
The maximum number of tries is $$ \lfloor \frac n2 \rfloor +2$$
You can find the proof here in chapter 4.