/* TODO: solveMaze - recursive function which will traverse the maze and find whether it's solveable S -> G The input is the index that we want to check: x = row, y = column ------ Hint ------- Cell(i,j) -> if its a wall return false Cell(i,j) is G return true Otherwise, mark cell(i,j) as visited (maybe make it a wall) and return if you can find a way out from the top, bottom, left, or right */ public static boolean solveMaze(int x, int y) { // modify HERE! return false; }

--------------

I already have a char[][] maze.

and have a method of isValid (checks if a position on the board has not been visited and is within bounds)

*JAVA

\#. \#\#\#\#\#