Updated Minecade.md (markdown)
commited
commit
4256d1c9557b13ac457f26e57682d18a4009aaa2
| ... | ... | @@ -1,47 +1,51 @@ |
| 1 | 1 | --- |
| 2 | 2 | quest: true |
| 3 | 3 | --- |
| 4 | [[Minecade|https://fancade.page.link/xfsd]] is a game by Mathias Elgaard where you uncover spaces with numbers without uncovering a mine, and you can flag spaces to help. Theres also a timer for if you want to speedrun a minesweeper map. |
|
| 4 | [[Minecade|https://fancade.page.link/xfsd]] is a [[Minesweeper|https://en.wikipedia.org/wiki/Minesweeper_(video_game)]] clone by Mathias Elgaard, where you uncover cells with numbers without uncovering a mine, and you can flag cells to help. |
|
| 5 | 5 | |
| 6 | ## How to play |
|
| 7 | Tap a space to uncover the space, the first uncovered space is never a mine. Hold a space for a long time to flag it, to win, uncover all spaces without mines, you "lose" (cant play anymore) if you touch a mine. NOTE: All puzzles are randomized, so there isnt a predetermined solution to win. |
|
| 6 | ## How to Play |
|
| 8 | 7 | |
| 9 | ### Rules |
|
| 10 | A number determines how much mines are adjacent to the cell, even diagonaly, an empty cell is a 0 clue. |
|
| 8 | Tap on a cell to uncover the cell. Hold on a cell for a long time to mark it as a flag. To win, uncover all cells without mines. You lose if you touch a mine. NOTE: All puzzles are randomized, so there isn't a predetermined solution to win. |
|
| 11 | 9 | |
| 12 | ## Helpful tricks |
|
| 13 | If you start with only 1 number, its just luck of the draw if you really start or reset. |
|
| 10 | A number determines how much mines are adjacent to the cell, even diagonally, an empty cell is a 0 clue. |
|
| 14 | 11 | |
| 15 | If you find a lot of numbers in a click, look for 1 clues which are in a neighbor with only 1 diagonal white cell, flag them. |
|
| 12 | ## Helpful Tricks |
|
| 16 | 13 | |
| 17 | Any 1 clues that are adjacent to the flag, are 0 clues and now can be safe to uncover those cells adjecent to those 1s. |
|
| 14 | Look for 1 clues which are in a neighbor with only 1 diagonal covered cell, you can flag them: |
|
| 18 | 15 | |
| 19 | Any other clues adjacent to the flag get "reduced" by 1 |
|
| 16 | [[/uploads/minecade-a1.png | height=200px]] |
|
| 20 | 17 | |
| 21 | If theres a cell where the number of total white cells adjacent is equal to the number in the cell, all cells are mines. |
|
| 18 | [[/uploads/minecade-a2.png | height=200px]] |
|
| 22 | 19 | |
| 23 | If the cell has equal amount of flags to the cell's number, all cells are safe UNLESS you made a mistake |
|
| 20 | Any 1 clues that are adjacent to the flag, are 0 clues and now can be safe to uncover those cells adjecent to those 1s: |
|
| 24 | 21 | |
| 25 | in a case like this |
|
| 22 | [[/uploads/minecade-a3.png | height=250px]] |
|
| 26 | 23 | |
| 27 | W 0 0 0 |
|
| 28 | 24 | |
| 29 | W 1 2 ? |
|
| 25 | Any other clues adjacent to the flag get "reduced" by 1. |
|
| 30 | 26 | |
| 31 | W O O A |
|
| 27 | To generalize, if there's a cell where the number of total white cells adjacent is equal to the number in the cell, all cells are mines: |
|
| 32 | 28 | |
| 33 | W O O O |
|
| 29 | [[/uploads/minecade-a4.png | height=250px]] |
|
| 34 | 30 | |
| 35 | The 1 has a mine on the bottom, but the 2 has a mine at the bottom as well, if theres not a mine in cell A, you cant satisfy both the clues at the same time, so the A cell is a mine and must be flagged. |
|
| 31 | If the cell has equal amount of flags to the cell's number, all cells are safe: (Unless if you made a mistake) |
|
| 36 | 32 | |
| 37 | W 0 0 0 |
|
| 33 | [[/uploads/minecade-a5.png | height=250px]] |
|
| 38 | 34 | |
| 39 | W 1 1 ? |
|
| 35 | ------------------- |
|
| 40 | 36 | |
| 41 | W O O B |
|
| 37 | Trickier strategies involve visualizing if a cell is a mine or not. |
|
| 42 | 38 | |
| 43 | W O O O |
|
| 39 | In a case like this: |
|
| 44 | 40 | |
| 45 | Same goes for this pattern, but inverted, if theres a mine in cell B, you can no longer satisfy both clues, so cell B is safe. |
|
| 41 | [[/uploads/minecade-b.png | height=150px]] |
|
| 42 | ||
| 43 | The 1 has a mine on the top, but the 2 has a mine at the top as well. If there's not a mine in cell A, you cant satisfy both the clues at the same time because the neighboring cells in the 2 is forced, and 1 has too much mines into it, so the A cell is a mine and must be flagged. |
|
| 44 | ||
| 45 | ------------------- |
|
| 46 | ||
| 47 | [[/uploads/minecade-c.png | height=150px]] |
|
| 48 | ||
| 49 | Same goes for this pattern, but inverted. If there's a mine in cell B, you can no longer satisfy both clues, since the 1 in the middle is forced to mark the remaining cells as safe, leaving no mines for the 1 on the right, so cell B is safe. |
|
| 46 | 50 | |
| 47 | 51 | Some cases are unwinnable without guessing, so some luck is involved in solving puzzles. |
| ... | ... | \ No newline at end of file |