-
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游戏截图
新游排行榜
新游期待榜
热门推荐
最新专题
- 2023现代战争游戏大全
- 热门的mmo手游排行榜2023
- 2023好玩的探险游戏有哪些
- 免费的音乐游戏推荐哪个好
- 最好玩的3a单机游戏有哪些
- 2019塔防游戏排行榜分享
- 2023适合情侣玩儿的游戏有哪些
- 2022日本手游排行榜
- 类似魔兽手游排行榜推荐2023
- 好玩的机动战士高达游戏有哪些
- 2023类似战争之人系列游戏有哪些
- 2023热门的单机手游枪战游戏排行榜前十名
- 2023新手游排行榜分享
- 世界大战游戏下载合集2023
- 80后喜欢玩的游戏有哪些
- 类似的二次元跑酷手游有哪些
- 2023不充值传奇手游排行榜
- 推理游戏app排行榜前十名
- 双人打僵尸小游戏推荐2023
- 好玩的跑男十大经典游戏盘点
- 有趣的女性养成类手游推荐哪个好
- 经典小霸王游戏有哪些
- 小时候玩过的街机游戏有哪些
- 热门的网游和单机游戏哪个好玩
- 适合深夜玩的游戏有哪些
- 植物大战僵尸手机版推荐
- 吞噬游戏有哪些吞噬类游戏排行榜2023
- 2023最火的模拟飞行游戏排行榜
- 老爹系列游戏有哪些
- 流行的钓鱼游戏哪个好
- 友情链接
- 最新游戏












粤公网安备44010602000283号
玩家评论
更多>>全部评论