Question
GIVEN MAZE DEMO SKELETON /** * * */ public class MazeDemo { public static void main(String args[]) { char[][] m = { {'*', ' ',
GIVEN MAZE DEMO SKELETON
/**
* * */ public class MazeDemo { public static void main(String args[]) { char[][] m = { {'*', ' ', '*', '*', '*', '*', '*', '*', '*'}, {'*', ' ', ' ', ' ', ' ', ' ', '*', ' ', '*'}, {'*', ' ', '*', '*', '*', '*', '*', ' ', '*'}, {'*', ' ', '*', ' ', '*', ' ', ' ', ' ', '*'}, {'*', ' ', '*', ' ', '*', '*', '*', ' ', '*'}, {'*', ' ', ' ', ' ', '*', ' ', ' ', ' ', '*'}, {'*', '*', '*', ' ', '*', ' ', '*', '*', '*'}, {'*', ' ', ' ', '*', ' ', ' ', '*', ' ', '*'}, {'*', '*', '*', '*', '*', '*', '*', ' ', '*'}}; Maze maze = new Maze(m); System.out.println(maze.escape(4, 3)); System.out.println("Expected: true"); System.out.println(maze.escape(5, 5)); System.out.println("Expected: false"); //You can create additional mazes to test your program } }
GIVEN MAZE SKELETON
public class Maze { private char[][] maze; private int width; private int height;
public Maze(char[][] aMaze) { maze = aMaze; width = maze[0].length; height = maze.length; } /** * Method to recursively check whether you can escape from the maze. * @param i current row position * @param j current column position * @return true if you can excape from the maze; else false */ public boolean escape(int i, int j) { //Complete this method }
}
JAVA.Must Use Recursion . Please include comments and explanation. Thank You.
Problem 2: Escaping a Maze You are currently located inside a maze. The walls of the maze are indicated by asterisks ). Use the following recursive approach to check whether you can escape from the maze: If you are at an exit, return true. Recursively check whether you can escape from one of the empty neighboring locations without visiting the current location. This method merely tests whether there is a path out of the maze. The skeleton of a class called Maze is provided to you. Complete the method public boolean escape(int i, int j) method provided in the Maze class that takes the current location as input, checks if you can escape from the maze and returns true if you can. A driver class called MazeDemo is also provided
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started