幅優先、深さ優先(再帰あり&再帰無し)探索 - Qiita

class Position: EMPTY = '.' BLOCK = '#' GOAL = 'G' START = 'S' CHECKED = 'o' maze = """ ############ S.#...###..# #...#.#.#.## #.#.#...#.## ###.#.#.#.## #...###...## #.#.#...#.## ###.#.#.#### #...#.###..G ###.#...#.## #...###.#.## ##.####...## ############ """ def maze2list() -> list[list[str]]: return [list(line) for line in maze.split()] def colored_maze(maze: list[list[str]]) -> str: colored_ma