Java implementation of maze backtracking algorithm

With an M × The rectangular matrix of N represents the maze, and 0 and 1 represent the paths and obstacles in the maze respectively. Design a program to find a path from the entrance to the exit for any set maze, or draw the conclusion that there is no path. (1) According to the two-dimensional array, output the graph of the maze. (2) explore the four directions of the maze: right is right, down is down, left is left, up is up, and output the walking path from the entrance to the exit.

Example: the upper left corner (1, 1) is the entrance and the lower right corner (8, 9) is the exit.

You can use the backtracking method, that is, start from the entrance and explore in a certain direction. If you can get through, continue to move forward; Otherwise, go back along the original road and continue to explore in another direction until the exit position to find a path. If all possible paths are explored and fail to reach the exit, the set maze has no path.

Running example:

Please enter the number of rows of the maze 3 Please enter the number of columns of the maze 3 Please enter the maze of 3 rows and 3 columns 0 1 0 0 1 0 0 0

The paths are as follows:

Please enter the number of rows of the maze 9 please enter the number of columns of the maze 8 please enter the maze of 9 rows and 8 columns 0 0 1 0 0 0 1 0 1 0 1 0 1 1 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0

The paths are as follows:

The above is the whole content of this article. I hope it will be helpful to your study, and I hope you can support programming tips.