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





新游排行榜
新游期待榜
热门推荐
最新专题
- 大人们最喜欢玩的游戏排行榜
- 人气较高的成语大全接龙游戏推荐
- 三国之乱世为王下载教程
- 塔防单机游戏下载大全2024
- 受欢迎的游戏排行榜
- 热门消消乐游戏有哪些2024
- 我的猫咪下载地址
- 推理高手预约地址分享
- 求生挑战下载方式
- 好玩的传奇手游都有什么
- 单机版战争策略游戏分享2024
- 耐玩的卡牌类游戏推荐
- 热门的tps游戏下载大全2024
- 流行的休闲养成类手游推荐
- 热门的3d手游推荐2024
- 二战飞机的游戏分享2024
- 手机小游戏有哪些2024
- 大型仙侠手游有哪些推荐2024
- 横版卡牌养成类手游大全2024
- 球球炫彩纷橙预约方式分享
- 挑战高手预约地址推荐
- 挑战高手下载链接
- 方块冲突预约地址推荐
- 代号大王牌下载地址
- 推理高手下载地址链接
- 2024恋爱养成类型游戏推荐
- 内购全免费的游戏合集分享2024
- 餐馆游戏有哪些
- 必玩的单机休闲游戏有哪些
- 双人联机对战游戏大全2024
- 友情链接
- 最新游戏
玩家评论
更多>>全部评论