So, Alice thinks of a number between 1 and 1000, and Bob makes up a list of questions.
Alice then receives the list, selects one question to leave blank, answers all of the other questions with yes or no, and returns the list to Bob.
Now Bob must guess Alice's number and, if he is wrong, he loses.
How many questions does Bob need to ask (non-adaptively) in order to correctly identify Alice's number and guarantee a win?