Modify the starter code for assignment 1 Java application to make the maze data structure 3-dimensional. Valid moves should now be "east", "west", "north", "south", "up" and "down". Use the following definition for the grid. // A maze grid with 3 levels (up and down) private int[][][] grid = {{ {1,1,1,1,0,1,1,1,0,1,1,0}, // Level 0 {0,0,0,1,1,1,0,1,1,1,0,0}, {0,0,1,0,0,0,1,0,0,1,1,0}, {1,0,0,0,0,1,1,0,1,1,0,0}, {0,0,1,1,1,1,1,1,1,0,1,0}, {0,1,1,1,1,1,1,1,0,1,1,0}, {0,0,0,0,0,0,1,1,0,0,1,0}, {1,1,1,1,1,0,0,1,1,0,1,0}, {0,0,0,0,0,0,1,1,1,0,1,0}, {1,1,1,1,1,0,0,0,1,0,0,0}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,0,0,0,0,0,0,0,0} }, { {0,1,1,1,0,0,1,1,0,1,1,0}, // Level 1 {0,0,0,1,1,0,0,1,0,1,0,0}, {0,0,0,0,0,0,1,0,0,0,1,0}, {1,0,0,0,0,1,1,0,1,0,0,0}, {0,0,0,0,1,1,1,1,1,0,1,0}, {0,1,0,1,1,0,1,1,0,1,1,0}, {0,0,0,0,0,0,1,1,0,0,1,0}, {1,0,0,0,1,0,0,1,1,0,1,0}, {0,0,0,0,0,0,1,1,1,0,1,0}, {1,1,0,1,1,0,0,0,0,0,0,0}, {1,0,0,0,0,1,1,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,0} }, { {0,1,1,1,0,0,1,1,0,1,1,0}, // Level 2 {0,0,0,1,1,0,0,1,0,1,0,0}, {1,1,1,0,0,0,1,0,0,0,1,0}, {1,0,0,0,0,1,1,0,1,0,0,0}, {0,0,1,1,1,1,1,1,1,0,1,0}, {0,1,1,1,1,0,1,1,0,1,1,0}, {0,0,0,0,0,0,1,1,0,0,1,0}, {1,1,1,1,1,0,0,1,1,0,1,0}, {0,0,0,0,0,0,1,1,1,0,1,0}, {0,0,0,0,1,0,0,0,1,0,0,0}, {0,0,0,0,0,0,1,1,0,1,1,1}, {1,1,1,1,0,0,0,0,0,0,0,1} }}; The grid entrance is at the array position [0][0][0] and the exit is at [2][11][11].

Starter Code:

package source;

public class PA2{

// 2D Version private int[][] maze = { {1,1,1,1,0,1,1,1,0,1,1,0}, {0,0,0,1,1,1,0,1,0,1,0,0}, {0,0,1,0,0,0,1,1,0,0,1,0}, {1,0,0,0,0,1,1,0,1,0,0,0}, {0,0,1,1,1,1,1,1,1,0,1,0}, {0,1,1,1,1,0,1,1,0,1,1,0}, {0,0,0,0,0,0,1,1,0,0,1,0}, {1,1,1,1,1,0,0,1,1,0,1,0}, {0,0,0,0,0,0,1,1,1,0,1,0}, {1,1,1,1,1,0,0,0,1,0,0,0}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,0,0,0,0,0,0,0,1} }; /* 3D Version private int [][][] maze = {{ {1,1,1,1,0,1,1,1,0,1,1,0}, // Level 0 {0,0,0,1,1,1,0,1,1,1,0,0}, {0,0,1,0,0,0,1,0,0,1,1,0}, {1,0,0,0,0,1,1,0,1,1,0,0}, {0,0,1,1,1,1,1,1,1,0,1,0}, {0,1,1,1,1,1,1,1,0,1,1,0}, {0,0,0,0,0,0,1,1,0,0,1,0}, {1,1,1,1,1,0,0,1,1,0,1,0}, {0,0,0,0,0,0,1,1,1,0,1,0}, {1,1,1,1,1,0,0,0,1,0,0,0}, {1,1,1,1,1,1,1,1,1,1,1,1}, {1,1,1,1,0,0,0,0,0,0,0,0} },

{ {0,1,1,1,0,0,1,1,0,1,1,0}, // Level 1 {0,0,0,1,1,0,0,1,0,1,0,0}, {0,0,0,0,0,0,1,0,0,0,1,0}, {1,0,0,0,0,1,1,0,1,0,0,0}, {0,0,0,0,1,1,1,1,1,0,1,0}, {0,1,0,1,1,0,1,1,0,1,1,0}, {0,0,0,0,0,0,1,1,0,0,1,0}, {1,0,0,0,1,0,0,1,1,0,1,0}, {0,0,0,0,0,0,1,1,1,0,1,0}, {1,1,0,1,1,0,0,0,0,0,0,0}, {1,0,0,0,0,1,1,0,0,0,0,1}, {1,0,0,0,0,0,0,0,0,0,0,0} },

{ {0,1,1,1,0,0,1,1,0,1,1,0}, // Level 2 {0,0,0,1,1,0,0,1,0,1,0,0}, {1,1,1,0,0,0,1,0,0,0,1,0}, {1,0,0,0,0,1,1,0,1,0,0,0}, {0,0,1,1,1,1,1,1,1,0,1,0}, {0,1,1,1,1,0,1,1,0,1,1,0}, {0,0,0,0,0,0,1,1,0,0,1,0}, {1,1,1,1,1,0,0,1,1,0,1,0}, {0,0,0,0,0,0,1,1,1,0,1,0}, {0,0,0,0,1,0,0,0,1,0,0,0}, {0,0,0,0,0,0,1,1,0,1,1,1}, {1,1,1,1,0,0,0,0,0,0,0,1} }}; */

int rowsize, colsize; boolean done = false;

public PA2() { /**************************** * * Add your code here * ***************************/

if (!done) // If no path found, print error message System.out.println("Error - no path to exit!"); System.out.println(); } public boolean traverse(int row,int col) { /**************************** * * Add your code here * ***************************/ return done; } public void printPosition(int row, int col) { if (row == 0 && col == 0) System.out.println("["+row+"]"+"["+col+"]"); else System.out.print("["+row+"]"+"["+col+"]-->"); } public static void main(String[] args) { PA2 pa2 = new PA2(); } }