Mastermind is NP-Complete

Simple item page
dc.creatorStuckman, Jeff
dc.creatorZhang, Guo-Qiang
dc.date2005-12-13
dc.date.accessioned2026-07-07T06:53:49Z
dc.date.available2026-07-07T06:53:49Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0512049
dc.identifierhttp://arxiv.org/abs/cs/0512049
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105726
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.titleMastermind is NP-Complete
dc.typetext

Files

Collections

arXiv