Guest Posted March 14, 2010 Report Share Posted March 14, 2010 In the classic game of mastermind (see rules here: http://www.degraeve.com/mastermind/rules.php ) what is the minimum number of guesses required to find the code every time. Now consider it with "n" slots and "m" colors. Quote Link to comment Share on other sites More sharing options...
0 Guest Posted March 17, 2010 Report Share Posted March 17, 2010 with 6 colors, 4 slots, the minimum to guarantee a solution is 5. with m colors, n slots, it gets much more challanging. in general however, i would estimate... m^n < n^x /((3+n-1)!/(3!(n-1)!)) where x is the number of guesses, and m > 2*n and simply m^n < n^x where n <= m <= 2*n, n >=4. for other cases, you may as well pick a number out of your hat. Quote Link to comment Share on other sites More sharing options...
Question
Guest
In the classic game of mastermind (see rules here: http://www.degraeve.com/mastermind/rules.php )
what is the minimum number of guesses required to find the code every time.
Now consider it with "n" slots and "m" colors.
Link to comment
Share on other sites
1 answer to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.