Chocolate Sweeper
玩新游,上九游

手机游戏> Chocolate Sweeper> 游戏评论

玩家评论

下载九游APP,参与更多评论(0条)
下载九游APP
点击下载按钮,或用手机二维码扫描可直接下载对应安装包!
立即下载九游APP

全部评论

Chocolate Sweeper

Chocolate Sweeper
类型:休闲
安卓:运营
订阅
How difficult can it be? Richard Ka [详情]

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/

开发者:互联网

tgamedetail_ff_2-tgamedetail_ff_1:50.0

tgamedetail_ff_3-tgamedetail_ff_2:0.0

tgamedetail_ff_4-tgamedetail_ff_3:9.0

tgamedetail_ff_5-tgamedetail_ff_4:7.0

tgamedetail_ff_6-tgamedetail_ff_5:5.0

tgamedetail_ff_6-tgamedetail_ff_1:71.0

t10_2-t10_1:7.0

t10_3-t10_2:6.0

t10_4-t10_3:8.0

t10_5-t10_4:8.0

t10_6-t10_5:0.0

t10_6-t10_1:29.0

扫码领取福利

下载九游APP,可获取更多礼包和攻略视频

九游云游戏
电脑也能玩手游 · 无需下载 · 不占空间 · 点击即玩
在线玩