Timeline for answer to How many guesses do you need at most to solve Mastermind variants? by Rand al'Thor
Current License: CC BY-SA 4.0
Post Revisions
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| 5 hours ago | comment | added | ralphmerridew | Graham Nelson wrote a paper on question 1. He found bounds between k/4 and k/4 + (small constant). | |
| 12 hours ago | history | edited | Rand al'Thor♦ | CC BY-SA 4.0 |
added 119 characters in body
|
| 12 hours ago | comment | added | Rand al'Thor♦ | @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. | |
| 12 hours ago | comment | added | bobble♦ | 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 :) | |
| 12 hours ago | comment | added | quarague | +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. | |
| 12 hours ago | history | edited | Rand al'Thor♦ | CC BY-SA 4.0 |
added 1461 characters in body
|
| 12 hours ago | history | answered | Rand al'Thor♦ | CC BY-SA 4.0 |