Python Minesweeper

The following is useful as part of a program to play Minesweeper. Suppose you have a 5 X 5 list that consists of zeros and M’s. Write a program that creates a new 5 5 list that hasM’s in the same place, but the zeroes are replaced by counts of how many M’s are in adjacent cells (adjacent either horizontally, vertically, or diagonally). An example is shown below. [Hint: short-circuiting may be helpful for avoiding index-out-of-range errors.]

L = [[0, 'M', 0, 'M', 0],
     [0, 0, 'M', 0, 0],
     [0, 0, 0, 0, 0],
     ['M', 'M', 0, 0, 0],
     [0, 0, 0, 'M', 0]]
brojac = 0
for i in range(len(L)):
    for j in range(len(L)):
        print(L[i][j], end=' ')
    print()
print()
for i in range(len(L)):
    for j in range(len(L)):
        brojac = 0
        if L[i][j] == 0:
            if i > 0 and L[i-1][j-1] == 'M':
                brojac += 1;
            if L[i-1][j] == 'M':
                brojac +=1;
            if 0 <= j <4 and i > 0 and L[i-1][j + 1] == 'M':
                brojac += 1;
            if L[i][j-1] == 'M':
                brojac +=1;
            if 0 <= j <4 and L[i][j+1] == 'M':
                brojac +=1;
            if 0 <= i <4 and L[i+1][j-1] == 'M':
                brojac +=1;
            if 0 <= i <4 and L[i+1][j] == 'M':
                brojac +=1;
            if 0 <= i <4 and 0 <= j < 4 and L[i+1][j+1] == 'M':
                brojac +=1;
            L[i][j] = brojac
for i in range(len(L)):
    for j in range(len(L)):
        print(L[i][j], end=' ')
    print()

0 M 0 M 0
0 0 M 0 0
0 0 0 0 0
M M 0 0 0
0 0 0 M 0

1 M 3 M 1
1 2 M 2 1
2 3 2 1 0
M M 2 1 1
2 2 2 M 1

Коментари

Постави коментар

Популарни постови са овог блога

Python read from text file V find average points per game

Слика
Find all the teams that averaged at least 115 points a game. basketball = [line.strip() for line in open ( 'C:/Users/ZM/Desktop/Documents/New folder/basketball1.txt' )] basketball1 = [line.split( ' \t ' ) for line in basketball] counter1 = 0 counter2 = 0 K = [] for i in range ( len (basketball1)):     if basketball1[i][ 0 ] not in K:       K.append(basketball1[i][ 0 ])     if   basketball1[i][ 2 ] not in K:       K.append(basketball1[i][ 2 ]) C = [] overall = [] for i in K:     for j in basketball1:         if i in j:             if i == j[ 0 ]:                 counter1 += int (j[ 1 ])             if i == j[ 2 ]:   ...
Прикажи све

Python DNA sequencing

Suppose you are given the following list of strings: L = ['aabaabac', 'cabaabca', 'aaabbcba', 'aabacbab', 'acababba'] Patterns like this show up in many places, including DNA sequencing. The user has a  string of their own with only some letters filled in and the rest as asterisks. An example  is a**a****. The user would like to know which of the strings in the list fit with their pattern.  In the example just given, the matching strings are the first and fourth. One way to  solve this problem is to create a dictionary whose keys are the indices in the user’s string of  the non-asterisk characters and whose values are those characters. Write a program implementing  this approach (or some other approach) to find the strings that match a user-entered string. L = [ 'aabaabac' , 'cabaabca' , 'aaabbcba' , 'aabacbab' , 'acababba' ] user = 'a**a****' d = {} d_user = {} T = [] counter1 = 0 ...
Прикажи све

Python read from text file VII find percentage letters in words

Слика
Using the wordlist, produce a dictionary whose keys are the letters a through z and whose values are the percentage of words that use that letter. wordlist = [line.strip() for line in open ( 'C:/Users/ZM/Desktop/Documents/New folder/wordlist.txt' )] L = [] for i in wordlist:     i= i.lower()     L.append(i) d = {} for i in L:     for w in i:         if w.isalpha():              if w in d:                 d[w] += 0              else :                   d[w] = 0 D = list (d) count = 0 for i in range ( len (D)):     for s in range ( len (L)):       ...
Прикажи све