The Minesweeper Consistency Problem (MCP) poses the following question: given a partially completed Minesweeper board, is there a way to place mines that satisfies the board? We will delve into the MCP and discuss what it means to be NP-complete along with a standard approach for showing a problem is NP-complete. Some familiarity with the game Minesweeper would be useful (you can play it for free online). No other prerequisite knowledge needed; an overview of the relevant topics in computational complexity will be given.