class Maze:
 def __init__(self, width, height):
  self.width = width
  self.height = height
  self.map = [[0 if x % 2 == 1 and y % 2 == 1 else 1 for x in range(width)] for y in range(height)]
  self.map[1][0] = 0 # 入口
  self.map[height - 2][width - 1] = 0 # 出口
  self.visited = []
  # right up left down
  self.dx = [1, 0, -1, 0]
  self.dy = [0, -1, 0, 1]

def generate(self):
 start = [1, 1]
 self.visited.append(start)
 wall_list = self.get_neighbor_wall(start)
 while wall_list:
  wall_position = random.choice(wall_list)
  neighbor_road = self.get_neighbor_road(wall_position)
  wall_list.remove(wall_position)
  self.deal_with_not_visited(neighbor_road[0], wall_position, wall_list)
  self.deal_with_not_visited(neighbor_road[1], wall_position, wall_list)

def dfs(self, x, y, path, visited=[]):
 # outOfIndex
 if self.is_out_of_index(x, y):
  return False

 # visited or is wall
 if [x, y] in visited or self.get_value([x, y]) == 1:
  return False

 visited.append([x, y])
 path.append([x, y])

 # end...
 if x == self.width - 2 and y == self.height - 2:
  return True

 # recursive
 for i in range(4):
  if 0 < x + self.dx[i] < self.width - 1 and 0 < y + self.dy[i] < self.height - 1 and \
    self.get_value([x + self.dx[i], y + self.dy[i]]) == 0:
   if self.dfs(x + self.dx[i], y + self.dy[i], path, visited):
    return True
   elif not self.is_out_of_index(x, y) and path[-1] != [x, y]:
    path.append([x, y])

[[0, 1], [1, 1], [2, 1], [3, 1], [4, 1], [5, 1], [6, 1], [7, 1], [8, 1], [9, 1], [9, 1], [8, 1], [7, 1], [6, 1], [5, 1], [5, 2], [5, 3], [6, 3], [7, 3], [8, 3], [9, 3], [9, 4], [9, 5], [9, 5], [9, 4], [9, 3], [8, 3], [7, 3], [7, 4], [7, 5], [7, 5], [7, 4], [7, 3], [6, 3], [5, 3], [4, 3], [3, 3], [2, 3], [1, 3], [1, 3], [2, 3], [3, 3], [3, 4], [3, 5], [2, 5], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 9], [1, 8], [1, 7], [1, 6], [1, 5], [2, 5], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 9], [3, 8], [3, 7], [3, 6], [3, 5], [3, 4], [3, 3], [4, 3], [5, 3], [5, 4], [5, 5], [5, 6], [5, 7], [6, 7], [7, 7], [8, 7], [9, 7], [9, 8], [9, 9], [10, 9]]

brew install python3 gcc sdl2 sdl2_image gifsicle
pip3 install -U pyxel

import pyxel

class App:
 def __init__(self):
  pyxel.init(160, 120)
  self.x = 0
  pyxel.run(self.update, self.draw)

 def update(self):
  self.x = (self.x + 1) % pyxel.width

 def draw(self):
  pyxel.cls(0)
  pyxel.rect(self.x, 0, 8, 8, 9)

App()

width, height = 37, 21
my_maze = Maze(width, height)
my_maze.generate()

class App:
 def __init__(self):
  pyxel.init(width * pixel, height * pixel)
  pyxel.run(self.update, self.draw)

 def update(self):
  if pyxel.btn(pyxel.KEY_Q):
   pyxel.quit()

  if pyxel.btn(pyxel.KEY_S):
   self.death = False

 def draw(self):
  # draw maze
  for x in range(height):
   for y in range(width):
    color = road_color if my_maze.map[x][y] is 0 else wall_color
    pyxel.rect(y * pixel, x * pixel, pixel, pixel, color)
  pyxel.rect(0, pixel, pixel, pixel, start_point_color)
  pyxel.rect((width - 1) * pixel, (height - 2) * pixel, pixel, pixel, end_point_color)

App()

self.index = 0
self.route = [] # 用于記錄待渲染的路徑
self.step = 1 # 步長(zhǎng)，數(shù)值越小速度越快，1：每次一格；10：每次 1/10 格
self.color = start_point_color
self.bfs_route = my_maze.bfs_route()

def draw(self):
 # draw maze
 for x in range(height):
  for y in range(width):
   color = road_color if my_maze.map[x][y] is 0 else wall_color
   pyxel.rect(y * pixel, x * pixel, pixel, pixel, color)
 pyxel.rect(0, pixel, pixel, pixel, start_point_color)
 pyxel.rect((width - 1) * pixel, (height - 2) * pixel, pixel, pixel, end_point_color)

 if self.index > 0:
  # draw route
  offset = pixel / 2
  for i in range(len(self.route) - 1):
   curr = self.route[i]
   next = self.route[i + 1]
   self.color = backtrack_color if curr in self.route[:i] and next in self.route[:i] else route_color
   pyxel.line(curr[0] + offset, (curr[1] + offset), next[0] + offset, next[1] + offset, self.color)
  pyxel.circ(self.route[-1][0] + 2, self.route[-1][1] + 2, 1, head_color)
def update(self):
 if pyxel.btn(pyxel.KEY_Q):
  pyxel.quit()

 if pyxel.btn(pyxel.KEY_S):
  self.death = False

 if not self.death:
  self.check_death()
  self.update_route()

def check_death(self):
 if self.dfs_model and len(self.route) == len(self.dfs_route) - 1:
  self.death = True
 elif not self.dfs_model and len(self.route) == len(self.bfs_route) - 1:
  self.death = True

def update_route(self):
 index = int(self.index / self.step)
 self.index += 1
 if index == len(self.route): # move
  if self.dfs_model:
   self.route.append([pixel * self.dfs_route[index][0], pixel * self.dfs_route[index][1]])
  else:
   self.route.append([pixel * self.bfs_route[index][0], pixel * self.bfs_route[index][1]])

App()