We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents e7686d2 + 8ff2d65 commit b64b401Copy full SHA for b64b401
backtracking/rat_in_maze.py
@@ -20,8 +20,13 @@ def solve_maze(
20
Return: True if the maze has a solution or False if it does not.
21
Description:
22
This method navigates through a maze represented as an n by n matrix,
23
+<<<<<<< HEAD
24
starting from a specified source cell and
25
aiming to reach a destination cell.
26
+=======
27
+ starting from a specified source cell (default: top-left corner) and
28
+ aiming to reach a destination cell (default: bottom-right corner).
29
+>>>>>>> origin/new_branch
30
The maze consists of walls (1s) and open paths (0s).
31
By providing custom row and column values, the source and destination
32
cells can be adjusted.
0 commit comments