In an episode of Odd Squad, the squad are left with five yes/no questions to get a three digit code out of a villain. Luckily for them, they have sufficient questions to guess the first number by splitting a number line and then the villain's predictable pattern (of always counting backwards) allows them to solve the code with their final question, the answer being 321.
Earlier in the episode they use a similar method, again splitting a number-line in half and asking if it's above or below the middle number (e.g. if the number is 6 on a line between 0-10, asking if the number is above 5(yes), then below 7(no), before finally guessing 6(yes).
Assuming the combination was a random number between 000 and 999, what is the minimum number of yes/no questions that would be need to be available in order to confidently solve any possible combination either using the technique above or one of your own devising.