0

Im stuck on how i shlud set up my Maze class in order to get started with solving it recursively. The maze has values stored into a two dimensional array " char[][] maze" and from there im stuck. heres my codes so far:

```
public class Maze {
char start;
int startX;
int startY;
char end;
int endX;
int endY;
char[][] maze;
public Maze(char[][] maze) {
this.maze = maze;
}
public void startPoint(){
for (int i=0; i < maze.length; i++){
for (int j=0; j < maze.length; j++){
if (String.valueOf(maze[i][j]) == "s"){
start = maze[i][j];
startX = i;
startY = j;
}
}
}
}
public void endPoint(){
for (int i=0; i < mazeArray.length; i++){
for (int j=0; j < mazeArray.length; j++){
if (String.valueOf(mazeArray[i][j]) == "e"){
end = mazeArray[i][j];
endX = i;
endY = j;
}
}
}
}
public void isWall(){
for (int i=0; i < maze.length; i++){
for (int j=0; j < maze.length; j++){
if (String.valueOf(maze[i][j]) == "|"){
wall = maze[i][j];
wallX = i;
wallY = j;
}
}
}
}
public void isPath() {
for (int i=0; i < maze.length; i++){
for (int j=0; j < maze.length; j++){
if (String.valueOf(maze[i][j]) == "."){
open = maze[i][j];
openX = i;
openY = j;
}
}
}
}
public void displayMaze() {
for (int i=0; i < maze.length; i++){
for (int j=0; j < maze.length; j++){
System.out.print(maze[i][j]);
}
System.out.println();
}
}
}
```

I just need some help. Can u point me in a specific direction as to what i should add, erase, and solve as simple as possible using recursive methods. Thanks!