Mastermind is a two player game. There are n colors. Let k < n be a positive number.
- Player one chooses a hidden sequence of
kcolors (colors may repeat) - The game proceeds iteratively as follows until player two has guessed the sequence correctly.
- Player two makes a guess of sequence of
kcolors - Player one gives feedback to player two by giving
- (red response) the number of correct colors in the correct positions, and
- (white response) the number of correct colors in the wrong positions.
- Player two makes a guess of sequence of
Play the game here
Create player two using a SAT solver that is tolerant to unreliable player one, i.e., sometimes player one gives wrong answer.
Consider an undirected connected graph G = (V, E) and nodes s,t ∈ V
Give a SAT encoding of removing the minimal set of edges such that s and t are not connected.