Menu
Static mastermind is like normal mastermind, except that the codebreaker must supply at one go a list of questions (candidate codes), the answers to which must uniquely determine the secret code. We confirm the minimum size list for some small values. Then we solve the game for up to 4 positions. In particular, we show that for \( k \) sufficiently large, the minimum size of a list for 4 positions and \( k \) colours is \( k – 1 \).