Chocolate Sweeper

How difficult can it be? Richard Kaye proved that Minesweeper is NP-complete That means MS can be a very difficult problem even for computers to solve. We made up such MS into a "perfect" puzzle game. I use "perfect" to mean that no guesses are required to solve puzzles, or even more strictly, no guesses are allowed.