-
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游戏截图
新游排行榜
新游期待榜
热门推荐
最新资讯
最新专题
- 免费离线单机游戏大全射击
- 好玩的高自由度开放世界手游大全
- 经典的打鲨鱼游戏排行榜前十名
- 罗马模拟经营游戏哪些值得玩2024
- 必玩的三职业传奇手游排行榜前十
- 大型网络单机游戏排行榜有哪些
- 狼人游戏卡牌类型分享
- 2024有趣的大型塔防游戏排行
- 必玩的神奇宝贝单机游戏分享
- 当下什么游戏没网也能玩2024
- 精美的国风手游排行前五2024
- 游戏王系列游戏下载介绍2024
- 狼人杀类似游戏有哪些
- 2023最火仙侠手游排行榜最新
- 追逐游戏哪些值得玩2024
- 飞行模拟手游下载介绍2024
- 好玩的21年游戏手机排行榜
- 经典的内置功能菜单的游戏大全
- 好玩的战略手游排行榜单
- 3d乙女游戏哪些值得玩2024
- 2024年十大手游排行榜
- 当下最好玩的手游排行榜
- 一款在冰天雪地里生存的游戏分享
- 热门的二战射击游戏合集下载
- 热门的4岁小孩玩的游戏大全2024
- 2022最火游戏排行榜前十名
- 中国最畅销游戏排行榜
- 好玩的治愈小游戏有哪些
- 免费三国单机游戏手机版合集2024
- 太空狼人杀游戏分享
- 友情链接
- 最新游戏












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