Question

Create a class called MazeSolver:

public class MazeSolver

{

   private char[][] maze;

   private int startx,

                    starty;

  Public MazeSolver(String fileName) throws IOException

  {

     // create an object to read information from “fileName”

     // read the maze dimension (row col) from the file

     // Allocate the space for maze

     // initialize array maze with contents of the file

     // find startx and starty

     printMaze(); // a method that prints the maze

     // solveMaze() is a recursive method to solve the maze

     if(solveMaze(maze,startx,starty)) {

       System.out.println(“Solution found”);

       printMaze();

    }

    else {

       System.out.println(“No solution found”);

    }

Answer 1

ANS :)

import java.io.File;
import java.io.IOException;
import java.util.InputMismatchException;
import java.util.Scanner;

public class MazeSolver {
private static char[][] maze;
private int startX=0;
private int startY=0;
private int endX=0;
private int endY=0;

public MazeSolver (final String filename) throws IOException {
int heightCounter = 0;
try (Scanner sc = new Scanner(new File(filename))) {
int width = sc.nextInt();
int height = sc.nextInt();
maze = new char[width][height];
startX = sc.nextInt();
startY = sc.nextInt();
endX = sc.nextInt();
endY = sc.nextInt();

while (sc.hasNext()) {
String line = sc.nextLine();

int counter = 0;
for (int i = 0; i < line.length(); i++){
if(line.charAt(i) != ' '){
maze[heightCounter][counter] = line.charAt(i);
counter++;
}
}
heightCounter++;
}
maze[startX][startY] = 'S';
maze[endX][endY] = 'E';

for (int i = 0; i < height; i++) {
for(int j = 0; j < width; j++) {

if(maze[i][j] == '1') {
maze[i][j] = '#';
}

if(maze[i][j] == '0') {
maze[i][j] = ' ';
}
}
}
//return new MazeSolver(maze, startX, startY, endX, endY);
} catch (InputMismatchException e) {
throw new IOException("Input cannot be parsed", e);
}
}
  
private boolean solve(int i, int j) {

if (maze[i][j] == '#') {
return false;
}

if (maze[i][j] == 'E') {
return true;
}

if (maze[i][j] == 'X') {
return false;
}

maze[i][j] = 'X';

//South
if ((solve(i + 1, j)) == true) {
return true;
}
//West
if ((solve(i, j - 1)) == true) {
return true;
}
//East
if ((solve(i , j + 1)) == true) {
return true;
}
//North
if ((solve(i - 1 , j)) == true) {
return true;
}   

maze[i][j] = ' ';
return false;
}
  
private void printMaze() {

maze[startX][startY] = 'S';
for (int i = 0; i < maze.length; i++) {
System.out.println(maze[i]);
}
}
  
public static void main(String[] args) throws Exception
{

MazeSolver ms = new MazeSolver("D:\\mazeFile.txt");
if(ms.solve(ms.startX, ms.startY)) {
ms.printMaze();
}
else {
System.out.println("The maze could not be solved");
}   
}   
}

INPUT File : mazeFile.txt

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

11 11
1 1
8 8
1 1 1 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0 0 1
1 0 1 0 1 1 1 1 1 1
1 0 1 0 0 0 0 0 0 1
1 0 1 1 0 1 0 1 1 1
1 0 1 0 0 1 0 1 0 1
1 0 1 0 0 0 0 0 0 1
1 0 1 1 1 0 1 1 1 1
1 0 1 0 0 0 0 0 0 1
1 1 1 1 1 1 1 1 1 1

Output : I hope you will get the answer