 If, however, a minesweeper board is already guaranteed to be consistent, solving it is not known to be NP-complete, but it has been proven to be co-NP-complete.Kaye also proved that infinite "Minesweeper" is Turing-complete.The first click will never be a mine.