Question

Need help!! Java Eclipse

Please provide the screenshot of output of code as well.

thank you...

PROGRAM 1 –Linear Data Structure Implementation (Due date: March 5^th, 2019, 5% Grade Points)

Given the starting point in a maze, you are to find and mark a path out of the maze which is represented by a 30x30 array of 1s (representing hedges) and 0s (representing the foot-paths). There is only one exit from the maze (represented by E). You may move vertically or horizontally in any direction that contains a 0; you may not move into a square with a 1. If you move into the square with an E, you have exited the maze. If you are in a square with 1s on three sides, you must go back the way you came and try another path. You may not move diagonally. For this program, use can ONLY use a single linked list.

Program Requirements: Your program should use single linked list ONLY for finding the path.

Input of program: Input is the following array of characters (1s, 0s, and E) from an ASCII text data file (maze.txt); as follows:

E0001110000000100100

11100011101110001111

11111000101000111000

00001110101100010010

01011000101111000110

00001110000110011110

11011100110110111000

00011110110111111101

01011011110110100001

01000000000110110111

11011011010010000000

01010010011000101011

01111000101110101110

00001110000111011001

01101011101101000011

11000110100111011010

01110000100100110011

11010111110110000000

01110100011000111110

00011001000011100010

Each data line consists of one row of maze. Starting points (i.e. a row, column pair) in the maze will be input from the keyboard.         

Output of program: Echo print the maze complete with numbered rows and columns prior to asking the user for their starting point. For each entry into the maze, print the complete maze with a S in the starting point followed by the words ‘I am free’ if you have found a path out of the maze or the words ‘Help, I am trapped’ if you cannot. Your output could be in two formats:

Print the path (by using a series of pluses (+)) you took through the maze should one be found OR Print the path as a single linked list. A program heading in the following format should begin your program:

                       

Answer 1

Program : Maze puzzle 30X30

Steps follows :-

1 - Creating txt file for maze called mazefile.txt
2 - establish 30 X 30 array to hold maze
3 - read maze info from file and call print method
4 - for loops to loop through 2d array reading through sc.next && sc.next line
5 - Try and catch block For exception handling printarray()
6 - praintarray() print the location 
7 - Asking from the user to enter in the starting location
8 - Switch cases confirm the location and check the condition 
9 - having interface Stack for 

           1- Inset a new iteminto the stack
           2- X the item to insert
           2- Function for PUSH,POP,TOP,IsEmpty,and Object(stack)

10 - Operation of Stack function

• Push();
  Remove the most recently inserted item from the stack.
  exception UnderflowException if the stack is empty.

• pop();
   Get the most recently inserted itemin the stack.
   Does not alter the stack.
   return the most recently inserted item in the stack.
   exception UnderflowException is fht estack is empty.
   

• top();
  Return and remove the most recently inserted itemfrom the stack.
  return the most recently inserted item in the stack.
  throws Underflow if the stack is empty.
  
  
  

• move();
  Return to original position and move
   position up, down , left and right*/

• isEmpty();
   Test if the stack is logically empty.
   return true if empty, false otherwise.
   X
  
  

Program is as follows :-

 
 
import java.io.*;
import java.util.*;
public class mazeGame {




static String[][]maze;
public static void main(String[] args)
    {
maze=new String[30][30];
maze=fillArray("mazefile.txt");
    }
public static String[][]fillArray(String file)
    {
     maze = new String[30][30];
        
        try{
        Scanner sc = new Scanner(new File(file));
        
        for(int row = 0; row < 30; row++)
        {
            for(int col = 0; col < 30; col++)
            {
                maze[row][col] = sc.next();
            }
            sc.nextLine();
        }
printArray();
       }
        catch(FileNotFoundException fe)
        {
        System.out.println("Error: file mazefile.txt not found!");
        }
     return maze;
    }
public static void printArray()
        {
    System.out.println();
    for(int row=0;row<30;row++)
    {
        for(int col=0;col<30;col++)
        {
            System.out.print(maze[row][col]+" ");
        }
        System.out.println();
    }


}

public void location()
{

    System.out.println("Please enter from the Matrix location S.");
Scanner StartingPoint  = new Scanner(System.in);
String index = StartingPoint.nextLine();
String[] indices = index.split(" ");
    }
public  String getByte( String arrayValue, int index)
    throws IllegalArgumentException, ArrayIndexOutOfBoundsException
{
return arrayValue;
    }

String x = arrayValue;
switch (x) {
  case 0:
    push();
    S = StartingPoint;
    System.out.println("S");
    break;
  case 1:
    Move();
    System.out.println("Help, I am trapped");
    break;
  case E:
    Exit();
    System.out.println("I am free");
    break;

  default:
    doSomethingElse();
}

}

public interface Stack
{
void push(Object X);
void pop();
Object top();
Object move();
boolean isEmpty();
public void push(Object X)
{
 if( topofStack + 1 == theArray.length)
     fillArray();
   maze[++topOfStack ] = x;
}

public void pop()
    {
     if(isEmpty())
         throw new UnderflowException( "ArrayStack pop");
     topOfStack--;
    }

public Object top()
{
    if( isEmpty())
        throw new UnderflowException( "ArrayStack top");
    return theArray[topOfStack];

}

}

Feel free to ask any follow up Questions

Answer 2

To implement the maze-solving algorithm using a single linked list, you can follow these general steps:

1. Read the maze data from the input file and store it in a suitable data structure, such as a 2D array.

2. Print the maze with numbered rows and columns to display it to the user.

3. Prompt the user to enter the starting point (row and column) in the maze.

4. Create a single linked list to store the path taken through the maze.

5. Implement a recursive function or a loop that explores the maze, following the rules provided. The function should track the current position, check for possible moves, update the linked list with each step, and continue until reaching the exit or getting trapped.

6. If a path to the exit is found, print the maze with the path marked using plus signs (+), or print the linked list representing the path.

7. If no path to the exit is found, print a message indicating that the person is trapped.

Please note that the actual implementation details, such as defining the linked list structure, writing the maze exploration algorithm, and handling specific movements, will depend on your programming language of choice.

I recommend starting by writing the code to read the maze data, display the maze, and prompt the user for the starting point. Then, you can proceed with implementing the maze exploration logic using a single linked list. If you encounter any specific issues or have further questions, feel free to ask for assistance.