迷宫算法路径查找器

我正在试图找到一个迷宫的路径，下面是代码，它假设进入递归求解循环，但它一直退出，如果第二个条件是我在这里做错了什么，有人能帮我吗？im默认情况下将Washer和correctpath数组设置为false。

recursiveSolve(0, 0);
public static int[,] maze = {{0, 0, 0, 0, 0, 1},
                             {1, 1, 0, 0, 0, 1},
                             {0, 0, 0, 1, 0, 0},
                             {0, 1, 1, 0, 0, 1},
                             {0, 1, 0, 0, 1, 0},
                             {0, 1, 0, 0, 0, 1}};
public static Boolean recursiveSolve(int row, int col) {
    Boolean[,] wasHere = new Boolean[6, 6];
    Boolean[,] correctPath = new Boolean[6, 6]; // The solution to the maze
    if (maze[row, col] == 1 || wasHere[row, col]) {
        return false;
    }
    else if (row == 0 || row == 6 - 1 || col == 0 || col ==6 - 1) {
        correctPath[row, col] = true;
        return true;
    }
    else {
        wasHere[row, col] = true;
        if (recursiveSolve(row - 1, col) || recursiveSolve(row + 1, col) ||
                                            recursiveSolve(row, col - 1) || 
                                            recursiveSolve(row, col +1)) {
            correctPath[row, col] = true;
            return true; // successfully escaped; this square is on path
        }
        else {
            return false;
        }
    }
}