def gen_map(self, max_x=10, max_y=10):
 """ 生成迷宮 """
 self.max_x, self.max_y = max_x, max_y # 設(shè)置地圖大小
 self.mmap = [[None for j in range(self.max_y)] for i in range(self.max_x)] # 生成原始地圖
 self.solution = [] # 迷宮解法
 block_stack = [Block(self, 0, 0)] # 從0,0開始生成迷宮（同時將這點作為起點），將起點放到棧里
 while block_stack:
  block = block_stack.pop() #取出當前所在的房間
  next_block = block.get_next_block() # 獲取下一個要去的房間
  if next_block: # 如果成功獲取下一走發(fā)，將走過的房間放回到棧里
   block_stack.append(block)
   block_stack.append(next_block)
   if next_block.x == self.max_x - 1 and next_block.y == self.max_y - 1: # 走到終點了，棧里的路徑就是解法
    for o in block_stack:
     self.solution.append((o.x, o.y))
 
def get_next_block_pos(self, direction):
 """ 獲取指定方向的房間號 """
 x = self.x
 y = self.y
 if direction == 0: # Top
  y -= 1
 elif direction == 1: # Right
  x += 1
 if direction == 2: # Bottom
  y += 1
 if direction == 3: # Left
  x -= 1
 return x, y
 
def get_next_block(self):
 """ 獲取下一要去的房間 """
 directions = list(range(4))
 random.shuffle(directions) # 隨機獲取一個要去的方向
 for direction in directions:
  x, y = self.get_next_block_pos(direction)
  if x >= self.mmap.max_x or x < 0 or y >= self.mmap.max_y or y < 0: # 房間號在許可范圍內(nèi)
   continue
  if self.mmap.mmap[x][y]: # 如果已經(jīng)走過
   continue
  self.walls[direction] = False
  return Block(self.mmap, x, y, direction)
 return None # 沒找到有可用的房間