Mastermind is NP-Complete

Details Mastermind is NP-Complete Mastermind is NP-Complete

2005-12-13

arxiv.org/abs/cs/0512049v1

Computer Science

Computational Complexity

Scientific paper

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 Satisfiability Problem in a similar spirit to the Minesweeper puzzle. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an addition to our knowledge about a host of other puzzles, such as Minesweeper, Mah-Jongg, and the 15-puzzle.

Affiliated with

Also associated with

No associations

Rating

Mastermind is NP-Complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mastermind is NP-Complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mastermind is NP-Complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36205