-
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游戏截图
新游排行榜
新游期待榜
热门推荐
最新专题
- 好玩的模拟汽车游戏有哪些
- 三七手游推荐
- 代号lovania免费下载安装最新版本
- kook加速器下载方法是什么
- 加速器都有哪些
- 加速器排行榜官网分享
- 好玩的加油站游戏怎么下载
- 儿童小游戏6到10岁推荐
- 流行的锈湖双人游戏有哪些
- 有趣的连双的数字有哪些游戏分享
- 热门的关卡游戏分享
- 塔防机枪可升级的单机游戏有什么
- 和节奏大师很像的一款音乐游戏叫什么
- 小朋友一起玩的游戏都有什么
- 免费版手游排行榜
- 必玩的生化危机游戏系列分享
- 战争之王游戏下载推荐2026
- 盘点最费钱的游戏
- 好爆手游下载大全2026
- 主机游戏下载合集2026
- 耐玩的灰姑娘游戏盘点
- 不错的三人小游戏不需要道具的手游分享
- 经典的地面部队游戏在哪里下载
- 假面骑士创骑游戏下载推荐2026
- 密室逃脱游戏全部系列盘点
- 2026有趣的摸鱼游戏盘点
- 打不出be的恋爱游戏有没有
- 经典的武侠单机手游盘点
- 好玩的消防员游戏有哪些
- 热门的无人游戏手机版盘点
- 友情链接
- 最新游戏












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