Stuckman and Zhang [1]} showed that it is NP-hard to determine whether a sequence of guesses with black and white peg answers is consistent with any codeword. The analogous result was shown by Goodrich [2]} assuming only black peg answers are given. It was shown by Viglietta [3]} that both of these results hold even for \(k=2\) .
