title: Using Depth First Search to go through a 2D list in python
body: <p>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.</p>
  
  <p>Maze Key:
  - 'S' start
  - 'G' goal
  - 'W' wall
  - 'x' floor</p>
  
  <p><strong><em>Example Maze</em></strong></p>
  
  <p>x S W</p>
  
  <p>x x W</p>
  
  <p>x W G</p>
  
  <p>x x x</p>