[UPDATED] TheAlgorithms#9066 Rate_in_Maze.py

Author: Muhammadummerr

Diff for: backtracking/rat_in_maze.py

@@ -9,8 +9,9 @@ def solve_maze(maze: list[list[int]]) -> bool:
     Returns:
         Return: True if the maze has a solution or False if it does not.
     Description:
-        This method navigates through a maze represented as an n by n matrix, starting from a specified source cell
-        (default: top-left corner) and aiming to reach a destination cell (default: bottom-right corner).
+        This method navigates through a maze represented as an n by n matrix,
+        starting from a specified source cell (default: top-left corner) and 
+        aiming to reach a destination cell (default: bottom-right corner).
         The maze consists of walls (0s) and open paths (1s).
         By providing custom row and column values, the source and destination cells can be adjusted.
     >>> maze = [[0, 1, 0, 1, 1],
@@ -27,7 +28,8 @@ def solve_maze(maze: list[list[int]]) -> bool:
     True
 
     Note:
-        In the output maze, the ones (1s) represent one of the possible paths from the source to the destination.
+        In the output maze, the ones (1s) represent one of the possible
+        paths from the source to the destination.
 
     >>> maze = [[0, 1, 0, 1, 1],
     ...         [0, 0, 0, 0, 0],
@@ -71,15 +73,17 @@ def solve_maze(maze: list[list[int]]) -> bool:
     destination_row=size-1
     destination_column=size-1
     solutions = [[0 for _ in range(size)] for _ in range(size)]
-    solved = run_maze(maze, source_row, source_column,destination_row,destination_column, solutions)
+    solved = run_maze(maze, source_row, source_column,destination_row,
+                      destination_column, solutions)
     if solved:
         print("\n".join(str(row) for row in solutions))
     else:
         print("No solution exists!")
     return solved
 
 
-def run_maze(maze: list[list[int]], i: int, j: int,destination_row:int,destination_column:int, solutions: list[list[int]]) -> bool:
+def run_maze(maze: list[list[int]], i: int, j: int,destination_row:int,
+             destination_column:int, solutions: list[list[int]]) -> bool:
     """
     This method is recursive starting from (i, j) and going in one of four directions:
     up, down, left, right.
@@ -109,10 +113,14 @@ def run_maze(maze: list[list[int]], i: int, j: int,destination_row:int,destinati
 
             # check for directions
             if (
-                run_maze(maze, i + 1, j,destination_row,destination_column, solutions)
-                or run_maze(maze, i, j + 1,destination_row,destination_column, solutions)
-                or run_maze(maze, i - 1, j,destination_row,destination_column, solutions)
-                or run_maze(maze, i, j - 1,destination_row,destination_column, solutions)
+                run_maze(maze, i + 1, j,destination_row,
+                            destination_column, solutions)
+                or run_maze(maze, i, j + 1,destination_row,
+                            destination_column, solutions)
+                or run_maze(maze, i - 1, j,destination_row,
+                            destination_column, solutions)
+                or run_maze(maze, i, j - 1,destination_row,
+                            destination_column, solutions)
             ):
                 return True