Timeline for Optimal strategy of modified Mastermind game
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20 at 15:08 | history | edited | wjmccann | CC BY-SA 4.0 |
deleted 10 characters in body
|
| Feb 20 at 13:32 | history | edited | RobPratt | CC BY-SA 4.0 |
added 3 characters in body
|
| Feb 20 at 8:21 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title
|
| Feb 20 at 8:01 | comment | added | YCor | @CommandMaster Player 2 knows the number of matches, not the indices | |
| Feb 20 at 2:47 | comment | added | Daniel Weber | If he gets the number then see, for example, the paper Playing Mastermind with Many Colors which shows an upper bound of $O(n\log\log n)$, and as far as I know it's the best known | |
| Feb 20 at 2:43 | comment | added | Daniel Weber | Wait, does he get the number of matches or the indices? | |
| Feb 20 at 2:32 | comment | added | Daniel Weber | You can do $n+1$ guesses by $1,2,...,n$, then $2,3,...,n,1$, and so on, and then you will know all values. | |
| Feb 20 at 2:25 | history | edited | RobPratt | CC BY-SA 4.0 |
edited body; edited tags
|
| Feb 19 at 20:33 | history | asked | wjmccann | CC BY-SA 4.0 |