0

I am trying to create a DFS algorithm to search a 2D List character maze in python but I am unsure as to how exactly to do it. The end goal is to find out as to whether or not the maze is solvable so I would return True if solvable and False otherwise.

Maze Key: - 'S' start - 'G' goal - 'W' wall - 'x' floor

Example Maze

x S W

x x W

x W G

x x x

indianskilz
  • 41
  • 3
  • 2
    Maybe this will help you start: https://towardsdatascience.com/depth-breath-first-search-matrix-traversal-in-python-with-interactive-code-back-to-basics-31f1eca46f55 – PeptideWitch May 06 '20 at 02:31
  • https://stackoverflow.com/search?q=dfs+python+list – Joe May 06 '20 at 05:20

0 Answers0