如何在java中找到迷宫的其他解决方案？

import java.util.ArrayList;
import java.util.List;

public class MazeSolver {
    private static final int[][] DIRECTIONS = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; // 可以移动的方向：右、下、左、上
    private int[][] maze;
    private int rows;
    private int cols;
    private List<List<int[]>> solutions;

    public MazeSolver(int[][] maze) {
        this.maze = maze;
        this.rows = maze.length;
        this.cols = maze[0].length;
        this.solutions = new ArrayList<>();
    }

    public List<List<int[]>> findAllSolutions() {
        boolean[][] visited = new boolean[rows][cols];
        List<int[]> path = new ArrayList<>();
        dfs(0, 0, visited, path);
        return solutions;
    }

    private void dfs(int row, int col, boolean[][] visited, List<int[]> path) {
        if (row < 0 || row >= rows || col < 0 || col >= cols || maze[row][col] == 1 || visited[row][col]) {
            return; // 越界、墙壁或已访问过的位置，直接返回
        }

        if (row == rows - 1 && col == cols - 1) {
            solutions.add(new ArrayList<>(path)); // 到达终点，将路径添加到解集中
            return;
        }

        visited[row][col] = true; // 标记当前位置为已访问

        for (int[] direction : DIRECTIONS) {
            int newRow = row + direction[0];
            int newCol = col + direction[1];
            path.add(new int[]{newRow, newCol}); // 将当前位置添加到路径中
            dfs(newRow, newCol, visited, path); // 递归探索下一个位置
            path.remove(path.size() - 1); // 回溯，移除当前位置
        }

        visited[row][col] = false; // 恢复当前位置为未访问状态
    }

    public static void main(String[] args) {
        int[][] maze = {
                {0, 1, 0, 0, 0},
                {0, 1, 0, 1, 0},
                {0, 0, 0, 0, 0},
                {0, 1, 1, 1, 0},
                {0, 0, 0, 1, 0}
        };

        MazeSolver solver = new MazeSolver(maze);
        List<List<int[]>> solutions = solver.findAllSolutions();

        for (List<int[]> solution : solutions) {
            System.out.println("Solution:");
            for (int[] position : solution) {
                System.out.println("(" + position[0] + ", " + position[1] + ")");
            }
            System.out.println();
        }
    }
}