1 paper · 1 filter
Jeff Stuckman, Guo-Qiang Zhang
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NP-complete. The Mastermind is a popular game which can be turned into a logical puzzle called Mastermind…