-
-
Save amankharwal/313b11d262fcc3609039f37314a766ad to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from colorama import Fore | |
def get_starting_finishing_points(): | |
_start = [i for i in range(len(maze[0])) if maze[0][i] == 'c'] | |
_end = [i for i in range(len(maze[0])) if maze[len(maze)-1][i] == 'c'] | |
return [0, _start[0]], [len(maze) - 1, _end[0]] | |
def maze_solver(): | |
for i in range(0, len(maze)): | |
for j in range(0, len(maze[0])): | |
if maze[i][j] == 'u': | |
print(Fore.WHITE, f'{maze[i][j]}', end=" ") | |
elif maze[i][j] == 'c': | |
print(Fore.GREEN, f'{maze[i][j]}', end=" ") | |
elif maze[i][j] == 'p': | |
print(Fore.BLUE, f'{maze[i][j]}', end=" ") | |
else: | |
print(Fore.RED, f'{maze[i][j]}', end=" ") | |
print('\n') | |
def escape(): | |
current_cell = rat_path[len(rat_path) - 1] | |
if current_cell == finish: | |
return | |
if maze[current_cell[0] + 1][current_cell[1]] == 'c': | |
maze[current_cell[0] + 1][current_cell[1]] = 'p' | |
rat_path.append([current_cell[0] + 1, current_cell[1]]) | |
escape() | |
if maze[current_cell[0]][current_cell[1] + 1] == 'c': | |
maze[current_cell[0]][current_cell[1] + 1] = 'p' | |
rat_path.append([current_cell[0], current_cell[1] + 1]) | |
escape() | |
if maze[current_cell[0] - 1][current_cell[1]] == 'c': | |
maze[current_cell[0] - 1][current_cell[1]] = 'p' | |
rat_path.append([current_cell[0] - 1, current_cell[1]]) | |
escape() | |
if maze[current_cell[0]][current_cell[1] - 1] == 'c': | |
maze[current_cell[0]][current_cell[1] - 1] = 'p' | |
rat_path.append([current_cell[0], current_cell[1] - 1]) | |
escape() | |
# If we get here, this means that we made a wrong decision, so we need to | |
# backtrack | |
current_cell = rat_path[len(rat_path) - 1] | |
if current_cell != finish: | |
cell_to_remove = rat_path[len(rat_path) - 1] | |
rat_path.remove(cell_to_remove) | |
maze[cell_to_remove[0]][cell_to_remove[1]] = 'c' | |
if __name__ == '__main__': | |
maze = [ | |
['w', 'c', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', | |
'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w'], | |
['w', 'c', 'c', 'w', 'c', 'w', 'c', 'c', 'w', 'w', 'c', 'c', 'c', 'c', | |
'c', 'w', 'w', 'c', 'w', 'w', 'c', 'c', 'c', 'c', 'c', 'c', 'w'], | |
['w', 'w', 'c', 'w', 'c', 'c', 'c', 'w', 'w', 'w', 'w', 'w', 'w', 'w', | |
'c', 'c', 'c', 'c', 'c', 'w', 'w', 'w', 'w', 'w', 'w', 'c', 'w'], | |
['w', 'c', 'c', 'c', 'c', 'w', 'c', 'c', 'c', 'c', 'c', 'c', 'c', 'c', | |
'c', 'w', 'c', 'w', 'c', 'c', 'c', 'c', 'c', 'c', 'c', 'c', 'w'], | |
['w', 'w', 'w', 'c', 'w', 'w', 'c', 'w', 'c', 'w', 'c', 'w', 'w', 'w', | |
'w', 'w', 'w', 'w', 'w', 'w', 'w', 'c', 'w', 'w', 'w', 'c', 'w'], | |
['w', 'c', 'c', 'c', 'c', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'c', | |
'c', 'c', 'c', 'c', 'c', 'c', 'c', 'c', 'w', 'c', 'c', 'c', 'w'], | |
['w', 'c', 'w', 'c', 'w', 'w', 'w', 'w', 'c', 'c', 'w', 'c', 'w', 'w', | |
'w', 'c', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'c', 'w'], | |
['w', 'w', 'w', 'w', 'w', 'w', 'c', 'w', 'w', 'c', 'c', 'c', 'w', 'c', | |
'w', 'w', 'w', 'w', 'w', 'w', 'c', 'c', 'c', 'c', 'c', 'c', 'w'], | |
['w', 'c', 'c', 'c', 'c', 'c', 'c', 'w', 'w', 'w', 'w', 'c', 'w', 'c', | |
'c', 'c', 'c', 'c', 'c', 'c', 'c', 'w', 'c', 'w', 'c', 'w', 'w'], | |
['w', 'w', 'c', 'w', 'c', 'w', 'c', 'c', 'c', 'c', 'c', 'c', 'c', 'c', | |
'w', 'w', 'c', 'w', 'c', 'w', 'c', 'w', 'c', 'w', 'c', 'c', 'w'], | |
['w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', | |
'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'w', 'c', 'w'] | |
] | |
start, finish = get_starting_finishing_points() | |
maze[start[0]][start[1]] = 'p' | |
rat_path = [start] | |
escape() | |
print(maze_solver()) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment