\ndef neighbours(r, col):\n\t\n\tglobal mine_values\n\tglobal numbers\n\tglobal vis\n\n\t# If the cell already not visited\n\tif [r,col] not in vis:\n\n\t\t# Mark the cell visited\n\t\tvis.append([r,col])\n\n\t\t# If the cell is zero-valued\n\t\tif numbers[r][col] == 0:\n\n\t\t\t# Display it to the user\n\t\t\tmine_values[r][col] = numbers[r][col]\n\n\t\t\t# Recursive calls for the neighbouring cells\n\t\t\tif r > 0:\n\t\t\t\tneighbours(r-1, col)\n\t\t\tif r < n-1:\n\t\t\t\tneighbours(r+1, col)\n\t\t\tif col > 0:\n\t\t\t\tneighbours(r, col-1)\n\t\t\tif col < n-1:\n\t\t\t\tneighbours(r, col+1)\t\n\t\t\tif r > 0 and col > 0:\n\t\t\t\tneighbours(r-1, col-1)\n\t\t\tif r > 0 and col < n-1:\n\t\t\t\tneighbours(r-1, col+1)\n\t\t\tif r < n-1 and col > 0:\n\t\t\t\tneighbours(r+1, col-1)\n\t\t\tif r < n-1 and col < n-1:\n\t\t\t\tneighbours(r+1, col+1)\t\n\t\t\t\t\n\t\t# If the cell is not zero-valued \t\t\t\n\t\tif numbers[r][col] != 0:\n\t\t\t\tmine_values[r][col] = numbers[r][col]\n<\/pre><\/div>\n\n\nFor this particular concept of the game, a new data structure is used, namely, vis<\/code>. The role of vis<\/code> to keep track of already visited cells during recursion. Without this information, the recursion will continue perpetually. <\/p>\n\n\n\nAfter all the cells with zero value and their neighbours are displayed, we can move on to the last scenario.<\/p>\n\n\n\n
Choosing a non zero-valued cell<\/h3>\n\n\n\n
No effort is needed to handle this case, as all we need to do is alter the displaying value.<\/p>\n\n\n
\n# If selecting a cell with atleast 1 mine in neighboring cells\t\nelse:\t\n\tmine_values[r][col] = numbers[r][col]\n<\/pre><\/div>\n\n\n
\n\n\n\nEnd game<\/h2>\n\n\n\n
There is a requirement to check for completion of the game, each time a move is made. This is done by:<\/p>\n\n\n
\n# Check for game completion\t\nif(check_over()):\n\tshow_mines()\n\tprint_mines_layout()\n\tprint("Congratulations!!! YOU WIN")\n\tover = True\n\tcontinue\n<\/pre><\/div>\n\n\nThe function check_over()<\/code>, is responsible for checking the completion of the game.<\/p>\n\n\n\n# Function to check for completion of the game\ndef check_over():\n\tglobal mine_values\n\tglobal n\n\tglobal mines_no\n\n\t# Count of all numbered values\n\tcount = 0\n\n\t# Loop for checking each cell in the grid\n\tfor r in range(n):\n\t\tfor col in range(n):\n\n\t\t\t# If cell not empty or flagged\n\t\t\tif mine_values[r][col] != ' ' and mine_values[r][col] != 'F':\n\t\t\t\tcount = count + 1\n\t\n\t# Count comparison \t\t\t\n\tif count == n * n - mines_no:\n\t\treturn True\n\telse:\n\t\treturn False\n<\/pre><\/div>\n\n\nWe count the number of cells, that are not empty or flagged. When this count is equal to the total cells, except those containing mines, then the game is regarded as over.<\/p>\n\n\n\n
\n\n\n\nClearing output after each move<\/h2>\n\n\n\n
The terminal becomes crowded as we keep on printing stuff on it. Therefore, there must be provision for clearing it constantly. This can be done by: <\/p>\n\n\n
\n# Function for clearing the terminal\ndef clear():\n\tos.system("clear")\n<\/pre><\/div>\n\n\nNote:<\/strong> There is a need to import the os<\/code> library, before using this feature. It can be done by 'import os'<\/code> at the start of the program.<\/p><\/blockquote>\n\n\n\n
\n\n\n\nThe complete code<\/h2>\n\n\n\n
Below is the complete code of the Minesweeper game:<\/p>\n\n\n
\n# Importing packages\nimport random\nimport os\n\n# Printing the Minesweeper Layout\ndef print_mines_layout():\n\n\tglobal mine_values\n\tglobal n\n\n\tprint()\n\tprint("\\t\\t\\tMINESWEEPER\\n")\n\n\tst = " "\n\tfor i in range(n):\n\t\tst = st + " " + str(i + 1)\n\tprint(st)\t\n\n\tfor r in range(n):\n\t\tst = " "\n\t\tif r == 0:\n\t\t\tfor col in range(n):\n\t\t\t\tst = st + "______"\t\n\t\t\tprint(st)\n\n\t\tst = " "\n\t\tfor col in range(n):\n\t\t\tst = st + "| "\n\t\tprint(st + "|")\n\t\t\n\t\tst = " " + str(r + 1) + " "\n\t\tfor col in range(n):\n\t\t\tst = st + "| " + str(mine_values[r][col]) + " "\n\t\tprint(st + "|")\t\n\n\t\tst = " "\n\t\tfor col in range(n):\n\t\t\tst = st + "|_____"\n\t\tprint(st + '|')\n\n\tprint()\n \n# Function for setting up Mines\ndef set_mines():\n\n\tglobal numbers\n\tglobal mines_no\n\tglobal n\n\n\t# Track of number of mines already set up\n\tcount = 0\n\twhile count < mines_no:\n\n\t\t# Random number from all possible grid positions \n\t\tval = random.randint(0, n*n-1)\n\n\t\t# Generating row and column from the number\n\t\tr = val \/\/ n\n\t\tcol = val % n\n\n\t\t# Place the mine, if it doesn't already have one\n\t\tif numbers[r][col] != -1:\n\t\t\tcount = count + 1\n\t\t\tnumbers[r][col] = -1\n\n# Function for setting up the other grid values\ndef set_values():\n\n\tglobal numbers\n\tglobal n\n\n\t# Loop for counting each cell value\n\tfor r in range(n):\n\t\tfor col in range(n):\n\n\t\t\t# Skip, if it contains a mine\n\t\t\tif numbers[r][col] == -1:\n\t\t\t\tcontinue\n\n\t\t\t# Check up\t\n\t\t\tif r > 0 and numbers[r-1][col] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\t\t\t# Check down\t\n\t\t\tif r < n-1 and numbers[r+1][col] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\t\t\t# Check left\n\t\t\tif col > 0 and numbers[r][col-1] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\t\t\t# Check right\n\t\t\tif col < n-1 and numbers[r][col+1] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\t\t\t# Check top-left\t\n\t\t\tif r > 0 and col > 0 and numbers[r-1][col-1] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\t\t\t# Check top-right\n\t\t\tif r > 0 and col < n-1 and numbers[r-1][col+1] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\t\t\t# Check below-left\t\n\t\t\tif r < n-1 and col > 0 and numbers[r+1][col-1] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\t\t\t# Check below-right\n\t\t\tif r < n-1 and col < n-1 and numbers[r+1][col+1] == -1:\n\t\t\t\tnumbers[r][col] = numbers[r][col] + 1\n\n# Recursive function to display all zero-valued neighbours\t\ndef neighbours(r, col):\n\t\n\tglobal mine_values\n\tglobal numbers\n\tglobal vis\n\n\t# If the cell already not visited\n\tif [r,col] not in vis:\n\n\t\t# Mark the cell visited\n\t\tvis.append([r,col])\n\n\t\t# If the cell is zero-valued\n\t\tif numbers[r][col] == 0:\n\n\t\t\t# Display it to the user\n\t\t\tmine_values[r][col] = numbers[r][col]\n\n\t\t\t# Recursive calls for the neighbouring cells\n\t\t\tif r > 0:\n\t\t\t\tneighbours(r-1, col)\n\t\t\tif r < n-1:\n\t\t\t\tneighbours(r+1, col)\n\t\t\tif col > 0:\n\t\t\t\tneighbours(r, col-1)\n\t\t\tif col < n-1:\n\t\t\t\tneighbours(r, col+1)\t\n\t\t\tif r > 0 and col > 0:\n\t\t\t\tneighbours(r-1, col-1)\n\t\t\tif r > 0 and col < n-1:\n\t\t\t\tneighbours(r-1, col+1)\n\t\t\tif r < n-1 and col > 0:\n\t\t\t\tneighbours(r+1, col-1)\n\t\t\tif r < n-1 and col < n-1:\n\t\t\t\tneighbours(r+1, col+1)\t\n\n\t\t# If the cell is not zero-valued \t\t\t\n\t\tif numbers[r][col] != 0:\n\t\t\t\tmine_values[r][col] = numbers[r][col]\n\n# Function for clearing the terminal\ndef clear():\n\tos.system("clear")\t\t\n\n# Function to display the instructions\ndef instructions():\n\tprint("Instructions:")\n\tprint("1. Enter row and column number to select a cell, Example \\"2 3\\"")\n\tprint("2. In order to flag a mine, enter F after row and column numbers, Example \\"2 3 F\\"")\n\n# Function to check for completion of the game\ndef check_over():\n\tglobal mine_values\n\tglobal n\n\tglobal mines_no\n\n\t# Count of all numbered values\n\tcount = 0\n\n\t# Loop for checking each cell in the grid\n\tfor r in range(n):\n\t\tfor col in range(n):\n\n\t\t\t# If cell not empty or flagged\n\t\t\tif mine_values[r][col] != ' ' and mine_values[r][col] != 'F':\n\t\t\t\tcount = count + 1\n\t\n\t# Count comparison \t\t\t\n\tif count == n * n - mines_no:\n\t\treturn True\n\telse:\n\t\treturn False\n\n# Display all the mine locations\t\t\t\t\t\ndef show_mines():\n\tglobal mine_values\n\tglobal numbers\n\tglobal n\n\n\tfor r in range(n):\n\t\tfor col in range(n):\n\t\t\tif numbers[r][col] == -1:\n\t\t\t\tmine_values[r][col] = 'M'\n\n\nif __name__ == "__main__":\n\n\t# Size of grid\n\tn = 8\n\t# Number of mines\n\tmines_no = 8\n\n\t# The actual values of the grid\n\tnumbers = [[0 for y in range(n)] for x in range(n)] \n\t# The apparent values of the grid\n\tmine_values = [[' ' for y in range(n)] for x in range(n)]\n\t# The positions that have been flagged\n\tflags = []\n\n\t# Set the mines\n\tset_mines()\n\n\t# Set the values\n\tset_values()\n\n\t# Display the instructions\n\tinstructions()\n\n\t# Variable for maintaining Game Loop\n\tover = False\n\t\t\n\t# The GAME LOOP\t\n\twhile not over:\n\t\tprint_mines_layout()\n\n\t\t# Input from the user\n\t\tinp = input("Enter row number followed by space and column number = ").split()\n\t\t\n\t\t# Standard input\n\t\tif len(inp) == 2:\n\n\t\t\t# Try block to handle errant input\n\t\t\ttry: \n\t\t\t\tval = list(map(int, inp))\n\t\t\texcept ValueError:\n\t\t\t\tclear()\n\t\t\t\tprint("Wrong input!")\n\t\t\t\tinstructions()\n\t\t\t\tcontinue\n\n\t\t# Flag input\n\t\telif len(inp) == 3:\n\t\t\tif inp[2] != 'F' and inp[2] != 'f':\n\t\t\t\tclear()\n\t\t\t\tprint("Wrong Input!")\n\t\t\t\tinstructions()\n\t\t\t\tcontinue\n\n\t\t\t# Try block to handle errant input\t\n\t\t\ttry:\n\t\t\t\tval = list(map(int, inp[:2]))\n\t\t\texcept ValueError:\n\t\t\t\tclear()\n\t\t\t\tprint("Wrong input!")\n\t\t\t\tinstructions()\n\t\t\t\tcontinue\n\n\t\t\t# Sanity checks\t\n\t\t\tif val[0] > n or val[0] < 1 or val[1] > n or val[1] < 1:\n\t\t\t\tclear()\n\t\t\t\tprint("Wrong input!")\n\t\t\t\tinstructions()\n\t\t\t\tcontinue\n\n\t\t\t# Get row and column numbers\n\t\t\tr = val[0]-1\n\t\t\tcol = val[1]-1\t\n\n\t\t\t# If cell already been flagged\n\t\t\tif [r, col] in flags:\n\t\t\t\tclear()\n\t\t\t\tprint("Flag already set")\n\t\t\t\tcontinue\n\n\t\t\t# If cell already been displayed\n\t\t\tif mine_values[r][col] != ' ':\n\t\t\t\tclear()\n\t\t\t\tprint("Value already known")\n\t\t\t\tcontinue\n\n\t\t\t# Check the number for flags \t\n\t\t\tif len(flags) < mines_no:\n\t\t\t\tclear()\n\t\t\t\tprint("Flag set")\n\n\t\t\t\t# Adding flag to the list\n\t\t\t\tflags.append([r, col])\n\t\t\t\t\n\t\t\t\t# Set the flag for display\n\t\t\t\tmine_values[r][col] = 'F'\n\t\t\t\tcontinue\n\t\t\telse:\n\t\t\t\tclear()\n\t\t\t\tprint("Flags finished")\n\t\t\t\tcontinue\t \n\n\t\telse: \n\t\t\tclear()\n\t\t\tprint("Wrong input!")\t\n\t\t\tinstructions()\n\t\t\tcontinue\n\t\t\t\n\n\t\t# Sanity checks\n\t\tif val[0] > n or val[0] < 1 or val[1] > n or val[1] < 1:\n\t\t\tclear()\n\t\t\tprint("Wrong Input!")\n\t\t\tinstructions()\n\t\t\tcontinue\n\t\t\t\n\t\t# Get row and column number\n\t\tr = val[0]-1\n\t\tcol = val[1]-1\n\n\t\t# Unflag the cell if already flagged\n\t\tif [r, col] in flags:\n\t\t\tflags.remove([r, col])\n\n\t\t# If landing on a mine --- GAME OVER\t\n\t\tif numbers[r][col] == -1:\n\t\t\tmine_values[r][col] = 'M'\n\t\t\tshow_mines()\n\t\t\tprint_mines_layout()\n\t\t\tprint("Landed on a mine. GAME OVER!!!!!")\n\t\t\tover = True\n\t\t\tcontinue\n\n\t\t# If landing on a cell with 0 mines in neighboring cells\n\t\telif numbers[r][col] == 0:\n\t\t\tvis = []\n\t\t\tmine_values[r][col] = '0'\n\t\t\tneighbours(r, col)\n\n\t\t# If selecting a cell with atleast 1 mine in neighboring cells\t\n\t\telse:\t\n\t\t\tmine_values[r][col] = numbers[r][col]\n\n\t\t# Check for game completion\t\n\t\tif(check_over()):\n\t\t\tshow_mines()\n\t\t\tprint_mines_layout()\n\t\t\tprint("Congratulations!!! YOU WIN")\n\t\t\tover = True\n\t\t\tcontinue\n\t\tclear()\t\n<\/pre><\/div>\n\n\n
\n\n\n\nConclusion<\/h2>\n\n\n\n
We hope that this tutorial on creating our own Minesweeper game was understandable as well as fun. For any queries, feel free to comment below. The complete code is also available on my Github account<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"In this article, we will be going through the steps of creating our own terminal-based Minesweeper using Python Language. About the game Minesweeper is a single-player game in which the player has to clear a square grid containing mines and numbers. The player has to prevent himself from landing on a mine with the help […]<\/p>\n","protected":false},"author":11,"featured_media":6507,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[9],"tags":[],"class_list":["post-6491","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-examples"],"blocksy_meta":[],"_links":{"self":[{"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/posts\/6491","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/users\/11"}],"replies":[{"embeddable":true,"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/comments?post=6491"}],"version-history":[{"count":0,"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/posts\/6491\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/media\/6507"}],"wp:attachment":[{"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/media?parent=6491"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/categories?post=6491"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.askpython.com\/wp-json\/wp\/v2\/tags?post=6491"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}