You have to find a three digit number called X with leading 0s allowed and each digit from 0-9.
Every move you can write a three digit number
After each move, you will be told
the number of digits you chose that are in X and in the correct position
the number of digits you chose that are in X but not in the correct position
e.g.
X = 329
you chose 239
You are told 1 digit is the correct digit and position
You are told 2 digits are the correct digits and wrong position.

What is your most optimal strategy to get X in the least number of moves possible?