-
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下载渠道分享
- 菜鸡梦想家预约地址在哪
- 经典的20002010单机游戏大全
- 2025最值得玩的三丽鸥古早小游戏有哪些
- 2025好玩的赛车游戏排行榜前五有哪些
- 2025最热门的迷宫游戏有哪些
- 趣味的儿童玩的游戏推荐
- 类似植物大战僵尸的塔防游戏有哪些
- 最难的游戏下载推荐
- 传奇手游排行榜推荐
- 2025最热门泰坦机甲手游有哪些
- 人气直播游戏有哪些
- 2025耐玩的飞行射击游戏推荐
- 中文游戏300个推荐
- 类似梦幻家园的游戏叫什么
- 大型单机联机游戏有什么
- 人气较高的对决游戏下载合集
- 2025最热门的狙击游戏有哪些
- 情侣手游推荐排行榜
- 有趣的有修改器的游戏大全
- 100个迷宫小游戏大全
- 人气较高的策略回合制游戏下载
- 人气较高的点点点的游戏大全
- 友情链接
- 最新游戏












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