Microsoft Minesweeper classic free game. Is one of the most interesting logic games. The objective of the game is to clear a rectangular board containing hidden 'mines' or landmine without detonating any of them, with help from clues about the number of neighboring landmine in each field. Minesweeper free features: - Variable minefield. Minesweeper is a single-player puzzle video game.The objective of the game is to clear a rectangular board containing hidden 'mines' or bombs without detonating any of them, with help from clues about the number of neighboring mines in each field.The game originates from the 1960s, and it has been written for many computing platforms in use today. It has many variations and offshoots. MineSweeper (Free) ‪Z Apps Studio‬. ‪Puzzle & trivia‬. MineSweeper is classic windows game. Minesweeper is a logic game where mines are hidden in a grid of squares. The object is to open all safe squares in the quickest time possible.

Free Play + No Downloads = Win

Play Classic Minesweeper as a stand alone web app.

This is a modern remake of the original minesweeper game with simple graphics.

  • Click the mouse randomly to uncover squares where there is (hopefully) no bomb.
  • After opening up a portion of the playing field use the numbers showing on some spaces to figure out where there are bombs.
  • Click on the flag button and then click on squares to lay flags where you believe there is a bomb..



Minesweeper retro game



Play Classic Minesweeper Online

You can play this simple minesweeper game by clicking in the window below.

Alternatively you can play this game as a web application here.

Classic Minesweeper Game Play Instructions

How to Play

Use the mouse or touch your screen to remove squares from the playing field and cover all squares with bombs with a flag.

Minesweeper Retro
  • Game Controls
    • Click the mouse to clear out squares where you think there is a bomb.
    • Click on the flag at the top of the playing field to lay flags where you are certain there is a bomb.
    • Unclick the flag button to remove other squares.
    • There is a restart button in the upper left corner.
  • Strategy on How to Beat Minesweeper
    • General
      • This game uses a 9 by 14 grid for a total of 126 squares.
      • Each game has around 25 bombs (plus or minus 2), giving each square about a 20% chance of having a bomb.
      • The bomb count is shown in the upper right corner. As you lay flags the bomb count decreases on the presumption that each flag you have laid is correct.
      • If you lay a flag in the wrong spot you can later remove it.
      • The game is timed, with the timer showing in the upper part of the screen.
    • Beginning the level
      • Off the start of the game you click on cells to reveal if they have bombs or not and open up a portion of the playing field.
      • To some degree this begins as a game of luck until you open up part of the playing field.
      • If an uncovered square does not have any numbers on it then you can clear out the 8 surrounding cells & repeat the process until there are numbers on the face of uncovered squares.
    • After the level has opened up
      • After you open up the playing field you can use numbers showing on the face of spots to do a process of elimination to figure out where bombs likely are.
      • If you look at multiple sets of numbers in near proximity they can help you create a matrix to solve where you are certain a bomb is or a bomb is not. Flag cells where there is a bomb and remove cells where there is not.
      • In some cases you end up having to guess to make progress. In general it is best to make guesses where you have a high probability of success. For example, if you know 3 out of 4 squares have a bomb trying to guess which one does not is a bad risk as you have a 75% chance of failure, but if you know 1 in 5 positions is a bomb you have only a 20% chance of failure.

Like This Game? Review Classic Minesweeper

Review Box 0
1 vote)
What people say... Leave your rating

Be the first to leave a review.

{{{ review.rating_title }}}
{{{review.rating_comment nl2br}}}

This review has no replies yet.

Show moreShow more

Retro Minesweeper Download

Leave your rating

Classic Minesweeper Online Game Screenshots

Mobile Friendly Cross Browser Support

This game is rendered in mobile-friendly HTML5, so it offers cross-device gameplay. You can play it on mobile devices like Apple iPhones, Google Android powered cell phones from manufactures like Samsung, tablets like the iPad or Kindle Fire, laptops, and Windows-powered desktop computers. All game files are stored locally in your web browser cache. This game works in Apple Safari, Google Chrome, Microsoft Edge, Mozilla Firefox, Opera and other modern web browsers.

This game was published using our teamwide account. If you have any comments, questions, concerns, or others (are there others even???) you can use the comments below to send along your 2 cents and help us improve the site further :) Your 2 cents plus 3 cents will buy you a nickel, but if your comments are genuinely useful and/or helpful and/or funny and/or memorable in a good way, we will probably say thanks :D

About Us

We like the Internet, the Outernet, the Extranet, and memes. And games. Lots and lots of games. :)

I am so old I played early Atari, ate at ShowBiz Pizza & was even a fan of ColecoVision.

#NightStalker #NeverForget #Roots

A typical minesweeper game with its commonly used style. This level (16 x 30 grid with 99 mines) is the 'Expert' setting in typical implementations. Many boards have unavoidable guesses, causing lost games.

Minesweeper is a single-playerpuzzlevideo game. The objective of the game is to clear a rectangular board containing hidden 'mines' or bombs without detonating any of them, with help from clues about the number of neighboring mines in each field. The game originates from the 1960s, and it has been written for many computing platforms in use today. It has many variations and offshoots.

Some versions of Minesweeper will set up the board by never placing a mine on the first square revealed.[1]Minesweeper for versions of Windows protects the first square revealed; from Windows Vista onward, players may elect to replay a board, in which the game is played by revealing squares of the grid by clicking or otherwise indicating each square. If a square containing a mine is revealed, the player loses the game. If no mine is revealed, a digit is instead displayed in the square, indicating how many adjacent squares contain mines; if no mines are adjacent, the square becomes blank, and all adjacent squares will be recursively revealed. The player uses this information to deduce the contents of other squares and may either safely reveal each square or mark the square as containing a mine.


In Minesweeper, mines (that resemble naval mines in the classic theme) are scattered throughout a board, which is divided into cells. Cells have three states: uncovered, covered and flagged. A covered cell is blank and clickable, while an uncovered cell is exposed. Flagged cells are those marked by the player to indicate a potential mine location.

Classic minesweeper windows 10

A player left-clicks a cell to uncover it. If a player uncovers a mined cell, the game ends, as there is only 1 life per game. Otherwise, the uncovered cells displays either a number, indicating the quantity of mines diagonally or orthogonally adjacent to it, or a blank tile (or '0'), and all adjacent non-mined cells will automatically be uncovered. Right-clicking on a cell will flag it, causing a flag to appear on it. Flagged cells are still considered covered, and a player can click on them to uncover them, although typically they must first be unflagged with an additional right-click.

The first click in any game will never be a mine.[2]

To win the game, players must uncover all non-mine cells, at which point, the timer is stopped. Flagging all the mined cells is not required.


Minesweeper has its origins in the earliest mainframe games of the 1960s and 1970s. The earliest ancestor of Minesweeper was Jerimac Ratliff's Cube. The basic gameplay style became a popular segment of the puzzle video game genre during the 1980s, with titles such as Mined-Out (Quicksilva, 1983), Yomp (Virgin Interactive, 1983), and Cube. Cube was succeeded by Relentless Logic (or RLogic for short), by Conway, Hong, and Smith, available for MS-DOS as early as 1985; the player took the role of a private in the United States Marine Corps, delivering an important message to the U.S. Command Center. RLogic had greater similarity to Minesweeper than to Cube in concept, but a number of differences exist:

  • In RLogic, the player must navigate through the minefield from the top left right angled corner to the bottom right angled corner (the Command Center).
  • It is not necessary to clear all non-mine squares. Also, there is no mechanism for marking mines or counting the number of mines found.
  • The number of steps taken is counted. Although no high score functionality is included, players could attempt to beat their personal best score for a given number of mines.
  • Unlike Minesweeper, the size of the minefield is fixed. However, the player may still specify the number of mines.
  • Because the player must navigate through the minefield, it is sometimes impossible to win — namely, when the mines block all possible paths.

The gameplay mechanics of Minesweeper are included in a variety of other software titles, including:

Retro Minesweeper Download

  • The mini-game Vinesweeper implemented into the MMORPGRuneScape; in this iteration (written by Jagex developer Danny J), the Minesweeper gameplay is given a large multiplayer aspect and the 'game board' adopts a continually resetting timer. This allows for a never-ending game of Minesweeper where the skill is assessed in points rather than 'game completion'.
  • The PC game Mole Control (developed by Remode); in this game, the Minesweeper mechanic is integrated into a puzzle adventure game based in a village called Molar Creek, which has been overrun with exploding moles. The player acts as the local inventor's assistant, who is tasked with clearing the village of exploding moles. A time attack mode, called the Molar Creek Annual Mole Control competition, is also available.

Distribution and variants[edit]

Versions of Minesweeper are frequently bundled with operating systems and GUIs, including Minesweeper for IBM's OS/2, Minesweeper in Windows, KMines in KDE (Unix-like OSes), GNOME Mines in GNOME and MineHunt in Palm OS. Many clones can be found on the Internet.

Variants of the basic game generally have differently shaped minefields, in either two or three dimensions, and may have more than one mine per cell. For example, X11-based XBomb adds triangular and hexagonal grids, and Professional Minesweeper for Windows includes these and others. There are also variants for more than one player, in which the players compete against each other.

The HP-48Ggraphing calculator includes a variation on the theme called 'Minehunt', where the player has to move safely from one corner of the playfield to the other. The only clues given are how many mines are in the squares surrounding the player's current position.

The Voltorb Flip game in the non-Japanese releases of Pokémon HeartGold and SoulSilver is a variation of Minesweeper and Picross.[3]

A tentaizu puzzle with three stars (mines) already located and four remaining to be found.

A logic puzzle variant of minesweeper, suitable for playing on paper, starts with some squares already revealed. The player cannot reveal any more squares, but must instead mark the remaining mines correctly. Unlike the usual form of minesweeper, these puzzles usually have a unique solution.[4] These puzzles appeared under the name 'tentaizu' (天体図), Japanese for a star map, in Southwest Airlines' magazine Spirit in 2008–2009.[citation needed]

In the game Minecraft, the 2015 April Fool's update 'The Love and Hugs Update' added 'Minescreeper'. It is a near exact copy of Minesweeper, except, instead of avoiding the mines, the player must avoid hidden Creepers.[citation needed]

  • Online, non-rectangular

  • 3D

  • Hexagonal

  • Triangular

  • Multiple mines in cells

Minesweeper Classic Retro

Computational complexity[edit]

In 2000, Richard Kaye published a proof that it is NP-complete to determine whether a given grid of uncovered, correctly flagged, and unknown squares, the labels of the foremost also given, has an arrangement of mines for which it is possible within the rules of the game. The argument is constructive, a method to quickly convert any Boolean circuit into such a grid that is possible if and only if the circuit is satisfiable; membership in NP is established by using the arrangement of mines as a certificate.[5] If, however, a minesweeper board is already guaranteed to be consistent, solving it is not known to be NP-complete, but it has been proven to be co-NP-complete.[6] In the latter case, however, minesweeper exhibits a phase transition analogous to k-SAT: when more than 25% squares are mined, solving a board requires guessing an exponentially-unlikely set of mines.[7]

Kaye also proved that infinite Minesweeper is Turing-complete.[8]

See also[edit]


  1. ^'Mines'. Retrieved 28 March 2017.
  2. ^'How to Play Minesweeper'. wikiHow. Retrieved 9 February 2020.
  3. ^Scullion, Chris (3 February 2010). 'News: Pokémon HeartGold/SoulSilver mini-game revealed! - Official Nintendo Magazine'. Archived from the original on 6 February 2010. Retrieved 13 January 2020.
  4. ^Minesweeper Puzzle Magazine, accessed 2017-02-07.
  5. ^Kaye (2000).
  6. ^Allan Scott, Ulrike Stege, Iris van Rooij, Minesweeper may not be NP-complete but is hard nonetheless, The Mathematical Intelligencer33:4 (2011), pp. 5–17.
  7. ^Dempsey, Ross; Guinn, Charles (2020). 'A Phase Transition in Minesweeper'. arXiv:2008.04116 [cs.AI].
  8. ^Kaye, Richard (31 May 2007). 'Infinite versions of minesweeper are Turing complete'(PDF). Archived from the original(PDF) on 3 August 2016. Retrieved 8 July 2016.


  • Adamatzky, Andrew (1997). 'How cellular automaton plays Minesweeper'. Applied Mathematics and Computation. 85 (2–3): 127–137. doi:10.1016/S0096-3003(96)00117-8.
  • Lakshtanov, Evgeny; Oleg German (2010). ''Minesweeper' and spectrum of discrete Laplacians'. Applicable Analysis. 89 (12): 1907–1916. arXiv:0806.3480. doi:10.1080/00036811.2010.505189. S2CID17474183.
  • Kaye, Richard (2000). 'Minesweeper is NP-complete'. Mathematical Intelligencer. 22 (2): 9–15. doi:10.1007/BF03025367. S2CID122435790. — Further information available online at Richard Kaye's Minesweeper pages.
  • Mordechai Ben-Ari (2018). Minesweeper is NP-Complete(PDF) (Report). Weizmann Institute of Science, Department of Science Teaching. — An open-access paper explaining Kaye's NP-completeness result.
Retrieved from ''
Coments are closed

Recent News

  • Regextor
  • ZipMounter
  • StoryBoard Quick
  • Candela
  • Melodics

Scroll to top