This a variation of the traditional game mastermind. There are 4 pegs and 6 colors of pegs in the code (repeats allowed). All rules are as usual, except for this one:
You are not given any hints (black and white pegs) after making a single guess. Instead, you must enter a series of $n$ guesses. After this, you are given all the hints to all the guesses. However, you must now enter your final guess.
What is the minimum value of $n$ for which you can guarantee your win? Also give the $n$ guesses and proof that it always works.
Twist (much harder)
You enter $n$ guesses and get the hints for them after the input. Then you enter $m$ guesses and get the hints after input. Now you make your final guess. Minimize $m+n$ so you can still guarantee a win.