Maze Algorithm in Python

Maze.py

@@ -0,0 +1,81 @@
+N = 4
+
+""" A utility function to print solution matrix
+sol """
+def printSolution(sol):
+	for i in range(N):
+		for j in range(N):
+			print(sol[i][j], end = " ")
+		print()
+
+""" A utility function to check if
+x, y is valid index for N*N maze """
+def isSafe(maze, x, y):
+
+	# if (x, y outside maze) return false
+	if (x >= 0 and x < N and y >= 0 and
+		y < N and maze[x][y] != 0):
+		return True
+	return False
+
+""" This function solves the Maze problem using
+Backtracking. It mainly uses solveMazeUtil() to
+solve the problem. It returns false if no path
+is possible, otherwise return True and prints
+the path in the form of 1s. Please note that
+there may be more than one solutions,
+this function prints one of the feasible solutions."""
+def solveMaze(maze):
+	sol = [[0, 0, 0, 0],
+		[0, 0, 0, 0],
+		[0, 0, 0, 0],
+		[0, 0, 0, 0]]
+	if (solveMazeUtil(maze, 0, 0, sol) == False):
+		print("Solution doesn't exist")
+		return False
+	printSolution(sol)
+	return True
+
+""" A recursive utility function
+to solve Maze problem """
+def solveMazeUtil(maze, x, y, sol):
+
+	# if (x, y is goal) return True
+	if (x == N - 1 and y == N - 1) :
+		sol[x][y] = 1
+		return True
+
+	# Check if maze[x][y] is valid
+	if (isSafe(maze, x, y) == True):
+
+		# mark x, y as part of solution path
+		sol[x][y] = 1
+
+		""" Move forward in x direction """
+		for i in range(1, N):
+			if (i <= maze[x][y]):
+
+				""" Move forward in x direction """
+				if (solveMazeUtil(maze, x + i,
+								y, sol) == True):
+					return True
+
+				""" If moving in x direction doesn't give
+				solution then Move down in y direction """
+				if (solveMazeUtil(maze, x,
+								y + i, sol) == True):
+					return True
+
+		""" If none of the above movements work then
+		BACKTRACK: unmark x, y as part of solution
+		path """
+		sol[x][y] = 0
+		return False
+	return False
+
+# Driver Code
+maze = [[2, 1, 0, 0],
+		[3, 0, 0, 1],
+		[0, 1, 0, 1],
+		[0, 0, 0, 1]]
+solveMaze(maze)