Maze3D - /* / Author: Lewis/Loftus / / Solution...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
//******************************************************************** // Author: Lewis/Loftus // // Solution to Programming Project 11.4 // // Represents a 3D maze of characters. The goal is to get from the // top left near corner to the bottom right far corner, following a path of 1s. // Prints the path of the final solution as it is discoverd. //******************************************************************** public class Maze3D { private final int TRIED = 3; private final int PATH = 7; private int[][][] maze; private int[][][] grid; public Maze3D(int[][][] newMaze) { maze = newMaze; } //----------------------------------------------------------------- // Creates a working copy of the maze to compute the final solution. // The original maze is not modified. Calls traverse to recursively // traverse the maze. //----------------------------------------------------------------- public boolean traverseMaze (int row, int column, int page) { // make copy of maze grid = new int[maze.length][maze[0].length][maze[0][0].length];
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/17/2011 for the course COP 3530 taught by Professor Davis during the Spring '08 term at University of Florida.

Page1 / 2

Maze3D - /* / Author: Lewis/Loftus / / Solution...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online