You may need this if you really want to use a recursive solution!
# It raises the cap on how many recursions can happen. Use this at your own risk!

import sys
# sys.setrecursionlimit(100000)
from cells import End, Start, Wall, Air, Fire, Teleport
from game import Game
from grid import grid_to_string

class MazeCell:
def __init__(self, row, col, display):
   self.row = row
   self.col = col
   self.display = display
   self.visited = False
   self.changed = False
   self.move = ''
   self.rev_move = ''

def is_safe(row, col, game, maze):
if maze[row][col].visited:
   if not maze[row][col].changed:
         return False
   else:
         return True
elif isinstance(game.grid[row][col], Wall):
   return False
elif isinstance(game.grid[row][col], Fire):
   if game.player.num_water_buckets > 0:
         return True
   else:
         return False
else:
   return True

def next_move(game, maze, queue, all_cell, end_cell, max_row, max_col, path, mode):

curr_cell = None
if mode == 'DFS':
   curr_cell = queue[-1]
else:
   curr_cell = queue[0]
maze[curr_cell.row][curr_cell.col].visited = True
curr_cell.visited = True
path_available = False
found = False

is_before_move_teleport = False
is_after_move_teleport = False
if isinstance(game.grid[curr_cell.row][curr_cell.col], Teleport):
   is_before_move_teleport = True

if curr_cell.col + 1 < max_col:
   if not path_available and is_safe(curr_cell.row, curr_cell.col + 1, game, maze):
         path_available = True
         maze[curr_cell.row][curr_cell.col + 1].visited = True
         maze[curr_cell.row][curr_cell.col + 1].move = 'd'
         maze[curr_cell.row][curr_cell.col + 1].rev_move = 'a'
         queue.append(maze[curr_cell.row][curr_cell.col + 1])
         path.append('d')
         cell_before_move = game.grid[curr_cell.row][curr_cell.col + 1]
         game.game_move('d')
         cell_after_move = game.grid[curr_cell.row][curr_cell.col + 1]
         # if cell_before_move.display != cell_after_move.display:
         # maze[curr_cell.row][curr_cell.col + 1].changed = True
         all_cell.append(maze[curr_cell.row][curr_cell.col + 1])
         if isinstance(game.grid[curr_cell.row][curr_cell.col + 1], End):
            found = True
if curr_cell.row + 1 < max_row:
   if not path_available and is_safe(curr_cell.row + 1, curr_cell.col, game, maze):
         path_available = True
         maze[curr_cell.row + 1][curr_cell.col].visited = True
         maze[curr_cell.row + 1][curr_cell.col].move = 's'
         maze[curr_cell.row + 1][curr_cell.col].rev_move = 'w'
         queue.append(maze[curr_cell.row + 1][curr_cell.col])
         path.append('s')
         cell_before_move = game.grid[curr_cell.row + 1][curr_cell.col]
         game.game_move('s')
         cell_after_move = game.grid[curr_cell.row + 1][curr_cell.col]
         # if cell_before_move.display != cell_after_move.display:
         # maze[curr_cell.row + 1][curr_cell.col].changed = True
         all_cell.append(maze[curr_cell.row + 1][curr_cell.col])
         if isinstance(game.grid[curr_cell.row + 1][curr_cell.col], End):
            found = True

if curr_cell.col - 1 >= 0:
   if is_safe(curr_cell.row, curr_cell.col - 1, game, maze):
         path_available = True
         maze[curr_cell.row][curr_cell.col - 1].visited = True
         maze[curr_cell.row][curr_cell.col - 1].move = 'a'
         maze[curr_cell.row][curr_cell.col - 1].rev_move = 'd'
         queue.append(maze[curr_cell.row][curr_cell.col - 1])
         path.append('a')
         cell_before_move = game.grid[curr_cell.row][curr_cell.col - 1]
         game.game_move('a')
         cell_after_move = game.grid[curr_cell.row][curr_cell.col - 1]
         # if cell_before_move.display != cell_after_move.display:
         # maze[curr_cell.row][curr_cell.col - 1].changed = True
         all_cell.append(maze[curr_cell.row][curr_cell.col - 1])
         if isinstance(game.grid[curr_cell.row][curr_cell.col - 1], End):
            found = True

A Program to Computer Net Pay Write a Program that will ask the us...