-
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游戏截图
新游排行榜
新游期待榜
热门推荐
最新专题
- 农场大逃亡中文版下载
- 明日暗黑中文版下载
- 蟠桃果园中文版下载
- 帕克与雷恩刑事司法中文版下载
- 灯芯中文版下载
- 莉拉的世界中文版下载
- 美食烹饪大亨中文版下载
- 猎人刺客2中文版下载
- 模拟首富中文版下载
- 狂暴大猩猩中文版下载
- 盘天之战中文版下载
- 猫英雄猫合并防御中文版下载
- 等于十中文版下载
- 莽荒仙界中文版下载
- 乱世枭臣中文版下载
- 末世大亨中文版下载
- 龙之沙漏中文版下载
- 蒙面枪手中文版下载
- 低语者中文版下载
- 地狱犬中文版下载
- 龙舞天下中文版下载
- 的一笔中文版下载
- 登天阙中文版下载
- 登山赛中文版下载
- 灯亮中文版下载
- 建立你的农场中文版下载
- 玛雅奇迹中文版下载
- 农夫的快乐农场中文版下载
- 地城中文版下载
- 克洛诺斯之门中文版下载
- 友情链接
- 最新游戏












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