We briefly make some remarks on other ranges of \(k\)  and \(n\)  for Mastermind. By combining Theorem REF  with results of Chvátal [1]} and Doerr, Doerr, Spöhel, and Thomas [2]}, we determine up to constant factors the smallest expected number of queries needed to solve mastermind for any \(n\)  and \(k\) .
