-
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游戏截图
新游排行榜
新游期待榜
热门推荐
最新专题
- 光与影33号远征队加速器掉线有用吗
- 真女神转生5复仇加速器用什么
- 神鬼寓言4加速器选哪个
- fragpunk加速器用什么
- 炽焰天穹下载链接介绍
- 植物大战僵尸高难版预约地址分享
- 植物大战僵尸3预约地址在哪
- 炽焰天穹预约地址在哪
- 占领世界版图的游戏下载分享2024
- 适合大班的亲子游戏合集2024
- 耐玩的网易吃鸡的游戏叫什么
- 世界上最好玩的一个游戏叫什么2024
- 适合大多数人玩的游戏有哪些2024
- 非常好玩的挑战赛游戏大全
- 不容错过的恋爱养成类游戏推荐
- 夺宝奇兵古老之圈加速器有用吗
- 2024必玩的猫鼠游戏推荐
- 手机上的即时战略手游有哪些
- 大型沙盒游戏手机版大全2024
- 小时候玩的手机单机游戏大全
- 有哪些类似王者荣耀的moba游戏
- 森林闪退怎么解决
- 潜渊症卡顿怎么解决
- 神话时代重述版加速器有用吗
- 非生物因素闪退怎么办
- 使命召唤战区加速器电脑端下载分享
- 三个人玩的益智游戏有哪些2024
- 比较好玩的军事游戏下载分享2024
- 手机上的蜘蛛侠游戏有哪些2024
- 热门的冒险闯关手游排行榜2024
- 友情链接
- 最新游戏
玩家评论
更多>>全部评论