Chocolate Sweeper 1.2.8

Nyahoon Games proudly presents a challenging rendition of Minesweeper. As Richard Kaye demonstrated, Minesweeper's complexity reaches NP-completeness, posing a formidable challenge even for computers.

This version of Minesweeper has been crafted into a meticulously constructed puzzle game, where solving without guesswork is paramount. Only squares deemed unquestionably safe – termed "chocolate cubes" in this game – can be unveiled, mirroring the gameplay to an enjoyable treat.

Featuring two engaging modes, Game and Puzzle, the latter offers 250 intricate puzzles to crack. In Game mode, players can tackle random puzzles sans the need for guessing, ensuring a continuously captivating experience.

Playing this rendition of Minesweeper illuminates the inherent difficulty and entertainment value this classic puzzle game offers. In the realm of NP-complete puzzles like Number Place and Nonogram, this game stands as a testament to riveting gameplay.

Chocolate Sweeper is meticulously optimized for mobile interfaces, delivering an unparalleled puzzle-solving experience on handheld devices.

However, prospective players should bear in mind that this game's sweetness belies its true challenge, making it unsuitable for casual relaxation gaming.

It is essential to note that this application collects user information for advertising and analytical purposes; users are encouraged to review and accept the updated privacy policy dated April 25, 2016.

• References:
• [1] Richard Kaye's Minesweeper Pages: http://web.mat.bham.ac.uk/R.W.Kaye/minesw/minesw.htm
• [2] R. Kaye. Minesweeper is NP-complete. Mathematical Intelligencer, 22(2):9–15, 2000
• [3] T. Yato. List of NP-Complete Pencil Puzzles: http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/puzcc.pdf
• [4] T. Yato and T. Seta. Complexity and completeness of finding another solution and its application to puzzles. IPSJ SIG Notes 2002-AL-87-2, IPSJ, 2002. http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/SIGAL87-2.pdf
• [5] N. Ueda and T. Nagao. NP-completeness results for NONOGRAM via parsimonious reductions. Technical Report TR96-0008, Department of Computer Science, Tokyo Institute of Technology, 1996