-
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游戏截图





新游排行榜
新游期待榜
热门推荐
最新专题
- 经典的餐厅的手游有哪些
- 最新的摩托车游戏下载在哪里
- 流行的逃生系列手游在哪里
- 有意思的修仙四万年游戏叫什么
- 好玩的骑马打仗游戏在哪里下载
- 2025火爆的策略战争手游top5
- 有哪些新的网游排行榜
- 高人气的国战类手游排行榜有哪些
- 值得推荐的机甲手游分享2025
- 高人气的世界大战游戏下载
- 类似太空游侠游戏有哪些介绍2025
- 好玩不费钱的手机网游介绍2025
- 四岁小孩玩益智游戏有哪些介绍2025
- 2025好玩的二次元音游有什么
- 可玩性高的手游排行榜
- 高人气的枪战剧情游戏手游推荐2025
- 在地下城寻求邂逅手游有没有
- 流行的无人机游戏模拟器有哪些
- 市面上机甲游戏有哪些介绍2025
- 高人气核辐射游戏有哪些
- 疯狂游戏下载哪些
- 四大格斗游戏有哪些介绍2025
- 不氪金的良心手游仙侠排行前五
- 2025趣味儿童学习游戏下载安装
- 无限子弹射击游戏推荐有哪些
- 一个小人闯关手机游戏有没有
- 流行的开罗打怪的游戏盘点
- 好玩的换装手游排行榜
- 好玩的3d格斗手机游戏排行榜
- 运动会可以玩的游戏有哪些2023
- 友情链接
- 最新游戏
玩家评论
更多>>全部评论