Python使用列表操作

Question

我創建了一個功能齊全的網格。有一名玩家可以四處移動並收集寶箱和地精。雖然在我產卵的地精和地精中有問題。他們擴大了我不想發生的網格大小。任何人都可以幫助解決這個問題嗎？需要修復的部分是ChestsandGoblins的功能。這是我的代碼：

from random import * 
# Set up Initial Variables 
Money = "0" 
grid = [] 
character = "X" 
# player_loc will hold the x, y location of the player 
player_loc = (0, 0) 
# These are a mapping of direction 
treasure_loc = (0, 0) 
NORTH = "N" 
SOUTH = "S" 
EAST = "E" 
WEST = "W" #All variables used for Later on 
Treasure = "T" 
Goblin = "G" 





def setupGrid(): 
global grid 
global row 
global N 
N = input("How big would you like the grid to be?") 
for x in range(0, (int(N))): 
    row = [] 
    for y in range(0, (int(N))): 
     if x == player_loc[0] and y == player_loc[1]: 
      row.append(character) 
     else: 
      row.append('O') 
    grid.append(row) 

def Chests_and_Goblins(): 
    global grid 
    global row 
    global N 
    print("How many chests would you like in the grid?")  
    B = input("The amount of chests you like is given by the amount of C's") 
    for each in B: 
     grid[randint(0, (int(N)))].insert(randint(0, (int(N))), Treasure) 
     grid[randint(0, (int(N)))].insert(randint(0, (int(N))), Goblin) 









def moveSouth(n): 
    global player_loc 
    grid[player_loc[0]][player_loc[1]] = "O" 
    grid[player_loc[0] + n][player_loc[1]] = character 
    player_loc = (player_loc[0] + n, player_loc[1]) 

def moveNorth(n): 
    global player_loc 
    grid[player_loc[0]][player_loc[1]] = "O" 
    grid[player_loc[0] - n][player_loc[1]] = character 
    player_loc = (player_loc[0] - n, player_loc[1]) 

def moveEast(n): 
    global player_loc 
    grid[player_loc[0]][player_loc[1]] = "O" 
    grid[player_loc[0]][player_loc[1] + n] = character 
    player_loc = (player_loc[0], player_loc[1] + n) 

def moveWest(n): 
    global player_loc 
    grid[player_loc[0]][player_loc[1]] = "O" 
    grid[player_loc[0]][player_loc[1] - n] = character 
    player_loc = (player_loc[0], player_loc[1] - n) 

def gridRunner(): 
    while True: 
     for row in grid: 
      print (row) 

     switch = {NORTH : moveNorth, 
        SOUTH : moveSouth, 
        EAST : moveEast, 
        WEST : moveWest } 
     P = input("What direction would you like to move in? North (N), South(S), East(E) or West(W)?").upper() 

     if P not in switch: 
      print ("invalid move") 
      continue 

     distance = int(input("How far would you like to move in this direction? (blocks are the units)")) 
     switch[P](distance) 







setupGrid() 
Chests_and_Goblins() 
gridRunner() 

Answer 1

insert將列表大小增加一。要保留列表的原始大小，請改用賦值。

grid[randint(0, int(N)-1)][randint(0, int(N)-1)] = Treasure 

請注意，這可能會覆蓋現有地精/寶物/玩家的位置。首先生成對象的x和y座標，然後驗證該位置沒有任何東西，然後才執行分配，這可能是一個好主意。

while True: 
    x = randint(0, int(N)) 
    y = randint(0, int(N)) 
    if grid[x][y] == "O": 
     grid[x][y] = Treasure 
     break