-
How difficult can it be? Richard Kaye proved that Minesweeper(MS) is NP-complete[1,2]. That means MS can be a very difficult problem even for computers to solve...
Chocolate Sweeper

How difficult can it be? Richard Kaye proved that Minesweeper(MS) is NP-complete[1,2]. 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. Only the squares (means "chocolate cubes" in this game) that are certainly safe can be uncovered (eaten). This game has two play modes, Game and Puzzle. Puzzle mode has 250 challenging puzzles. In Game mode, you can play random puzzles like standard MS, but they are guess-free. You will never get tired of playing! Once you play this game, you will realize that MS was such a difficult, but very fun puzzle game. Some other popular puzzle games are also proven as NP-complete[3,4,5]. Therefore, I can say this game is as much fun as those puzzle games. Chocolate Sweeper is optimized for mobile screen size and touch interface. This is the best puzzle game you can play on a mobile device! Please be cautioned that this game is not as sweet as it looks. It is really difficult, and not recommended for those people who just want to play games for relaxation. This App collects some user information for ads and analytics. Please understand and agree with our privacy policy (updated on 25 April 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. ======================================= This App uses free sound assets available from the following websites. We acknowledge their substantial contributions with many thanks. - BGM MusMus: http://musmus.main.jp/ - BGM/Jingle/Sound Effects Pocket Sound: http://pocket-se.info/ - Sound Effects Kurage-Kosho: http://www.kurage-kosho.info/ Music is VFR: http://musicisvfr.com/
Chocolate Sweeper游戏截图





新游排行榜
新游期待榜
热门推荐
最新专题
- 耐玩的音乐小游戏有哪些
- 关于火的手游下载推荐
- 热门的喜羊羊游戏闯关游戏推荐
- 人气较高的修仙单机手游推荐
- 好玩的换装手游排行榜
- 好玩的3d格斗手机游戏排行榜
- 运动会可以玩的游戏有哪些2023
- 一个勇士救公主的老游戏叫什么
- 以前有一款滚球叫什么游戏
- 真正的山海经吞噬进化游戏推荐
- 游戏热度排行榜前五
- 人气较高的单机网游分享2023
- 网易最好玩的仙侠手游推荐
- 人气较高的游戏车比赛下载合集
- 好玩的五子棋游戏下载双人推荐
- 好玩的3d动作网络游戏下载合集
- 经典的手游生存游戏下载推荐
- 市面上最肝的游戏有哪些
- 不要网络的单机游戏有哪些好玩的
- 好玩的女生解闷游戏下载推荐
- 主播玩的最热门的游戏有哪些
- 有趣的3d动作游戏好玩的有哪些
- 挺火的手游有哪些
- 关于计算机的游戏排行榜
- 网易游戏很火的游戏有哪些
- 开心消消乐游戏大全分享2023
- 类似中世纪吃鸡游戏有哪些2023
- 中巴车模拟驾驶游戏2023
- 免费的末日题材系列手机游戏前五
- 2023游戏大全单机推荐
- 友情链接
- 最新游戏
玩家评论
更多>>全部评论