Skip to main content
Puzzling

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • $\begingroup$ +1. While this is probably a non-trivial mathematical theorem, the bound is at least for small values of $n$ and $k$ fairly lousy. In the classic mastermind this gives a bound of at most 36 questions whereas the best algorithm only takes 4 questions. $\endgroup$ Commented 12 hours ago
  • 1
    $\begingroup$ Heh, sorry about the notation swap. I'm going to edit the Q to change it to be consistent with the paper, that way you can discuss it easier :) $\endgroup$ Commented 12 hours ago
  • 1
    $\begingroup$ @bobble No need! It's very normal in maths for different people to use different notations for the same problem, and there's no particular reason that $n$ and $k$ should be one way round or the other in this case. $\endgroup$ Commented 12 hours ago
  • $\begingroup$ Graham Nelson wrote a paper on question 1. He found bounds between k/4 and k/4 + (small constant). $\endgroup$ Commented 5 hours ago