Maze3DSearch - for (int k = 0; k < MAX_SIZE; k++) { if...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
//******************************************************************** // Maze3DSearch.java Author: Lewis/Loftus // // Solution to Programming Project 11.4 // // Creates a random 3D maze and attempts to solve it. Repeats until // a maze is solved and prints out the traversal steps. //******************************************************************** import java.util.Random; public class Maze3DSearch { private static final int MAX_SIZE = 10; //----------------------------------------------------------------- // Generates a random 3D maze //----------------------------------------------------------------- public static int[][][] generateRandom3DMaze() { Random gen = new Random(); int[][][] maze = new int[MAX_SIZE][MAX_SIZE][MAX_SIZE]; for (int i = 0; i < MAX_SIZE; i++) for (int j = 0; j < MAX_SIZE; j++)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: for (int k = 0; k < MAX_SIZE; k++) { if (gen.nextBoolean()) maze[i][j][k] = 1; else maze[i][j][k] = 0; } return maze; } //-----------------------------------------------------------------// Creates a random maze and attempts to solve it. Repeats until // a maze is solved and prints out the traversal steps //-----------------------------------------------------------------public static void main(String args) { boolean done = false; int numMazes = 0; while (!done) { Maze3D labyrinth = new Maze3D(Maze3DSearch.generateRandom3DMaze()); numMazes++; if (labyrinth.traverseMaze (0, 0, 0)) { System.out.println ("The maze was successfully traversed!"); System.out.println("Num mazes generated : " + numMazes); done = true; } } } }...
View Full 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.

Ask a homework question - tutors are online