How many guesses do you need at most to solve Mastermind variants? Isn't the question how many you need at least in order to solve all possible answers, rather than at most (as written in the title)? At most, disallowing identical guesses, it's the same number as the amount of possible answers
Oriental House: An original grid-deduction challenge A different approach to an old concept of mine, Oriental House is a new grid-deduction puzzle based once again off exits and entries The rules are as follows: Draw a path from S to F, passing thr
What is the optimal first move in Mastermind? Any first move is equal, as long as it follows the pattern XXYY The way you number the holes in the first move is only a base reference point for the subsequent moves So, choose an arbitrary first move, name those first choices as they are named at the start of the stragey and then apply the complete strategy The article basically says "start with 1122, since it's proven to be better than
mastermind - Guess my number - Puzzling Stack Exchange There is a popular game called Mastermind in which one player guesses another player's secret sequence - it could be a word, some colors, or numbers The guesser says a possible sequence, and they
Mastermind puzzle: 3548 has 2 correct, one in right place Hints: 3548 - 2 correct digits, but only 1 in the right place 4860 - 1 correct digit, but in the wrong place 2356 - 3 correct digits, but only 1 in the right place 2584 - 2 correct digits and in th
Mastermind: What should I guess next? That depends We start with usual Mastermind logic: Where can the second clue get a black dot from? Not one of the B’s otherwise clue 1 or 3 is broken Therefore the first letter is E The fourth clue tells us the second and third letters are D and C, respectively That only leaves three choices: EDCC, EDCD, EDCE Now the interesting part: The obvious strategy is guess randomly, e g choose EDCC first
What is the strategy to solve Simon Tathams Twiddle? Update: Simon Tatham's Twiddle has been solved! Almost complete answer, which solves for ALL board sizes, accounts for the variation in which orientation is not preserved with rotation, but cannot show how puzzles with larger block rotation can be solved Consider a puzzle of any size of side length $\geq 3$, with $2 \times 2$ rotating blocks We can ignore orientation for now We prove that
Colorblind Mastermind - Puzzling Stack Exchange This puzzle is part of the Monthly Topic Challenge #7: Board games Inspired by the incident, I created a variant of Mastermind, although it wasn't actually intended for colorblind people The main
Crack the lock code - Puzzling Stack Exchange The tag mastermind was added a couple of days ago Of course you need to make some assumptions to solve this puzzle, I will assume the puzzle is using base ten among other things, but I will not assume that mastermind's rules apply