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





新游排行榜
新游期待榜
热门推荐
最新专题
- 打击感强的手游有哪些
- 人气b站游戏有哪些
- 火影同人系列游戏有哪些
- 高人气养成类游戏推荐
- 好玩的女生装扮小游戏有哪些
- 耐玩的生死游戏有哪些
- 休闲玩家玩什么网游
- 角色扮演类游戏排行前五
- 热门的华为游戏有哪些
- 热门的枪战游戏有什么
- 类似博德之门3的手游推荐
- 有趣的丧尸射击类手游下载安装
- 好玩的布鲁伊游戏推荐
- 不肝不氪适合长期玩的网游推荐
- 免费的西方魔幻卡牌手游下载
- 有意思的江湖游戏有没有
- 曾经的单机游戏推荐
- 2025猜数字游戏有哪些
- 最经典的修仙游戏排名
- 除了魔兽世界还有好玩的网游吗
- 2025真人女友养成类游戏推荐
- 传奇单机版手游有没有
- 手机双人同屏单机游戏有哪些
- 高人气老爹店游戏大全
- 耐玩的求生游戏大全
- 流行的火影像素版下载
- 受欢迎的射击小游戏有哪些
- 2025值得玩的棋盘游戏合集
- 2025五大高品质的模拟驾驶游戏推送
- 快手小游戏有什么
- 友情链接
- 最新游戏
玩家评论
更多>>全部评论