Effective "handy way" of solving Mastermind
My previous way of solving Mastermind suffered the fact of changing only one position per turn. This aspect was very moves consuming, mining the effectiveness of the strategy.
Useful takeaways from this story.
My previous way of solving Mastermind suffered the fact of changing only one position per turn.
This aspect was very moves consuming, mining the effectiveness of the strategy.
In what follows, I'm assuming that the final combination has no repeated numbers or colours and that it's possible to use more numbers or coins of the same colour in the same turn.
Building the complete brief
The page is ready to read now. The fuller skim-friendly version will appear here automatically.
The useful part
My previous way of solving Mastermind suffered the fact of changing only one position per turn. This aspect was very moves consuming, mining the effectiveness of the strategy. In what follows, I'm assuming that the final combination has no repeated numbers or colours and that it's possible to use more numbers or coins of the same colour in the same turn.
How it works
- I've searched, and this assumption does not go against any rule.
- In what follows, I will use the terms "Group position" meaning "a couple of adjacent coins of the same colour" and "Correct group position" meaning "a couple of adjacent coins of the same colour whose one...
- The basic idea is choosing two coins and covering the positions with them in order.
- For example, if the combination consists of 4 coins of different colors, we have 2 pairs of two colors.
What to take from it
This means two coins of one color in the first and second positions and the other in the remaining ones. Considering the first case, then choose one of the previous couples and another new one.
Keep reading in the app
Open the app view to save this story, compare related coverage, and continue from the same source.