Welcome to the Java Programming Forums


The professional, friendly Java community. 21,500 members and growing!


The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.


>> REGISTER NOW TO START POSTING


Members have full access to the forums. Advertisements are removed for registered users.

Results 1 to 2 of 2

Thread: Recursive Maze Help

  1. #1
    Junior Member
    Join Date
    Nov 2012
    Posts
    6
    Thanks
    0
    Thanked 1 Time in 1 Post

    Default Recursive Maze Help

    Hi All,

    I am having a problem with this maze project that I was assigned in my programming and data structures class. I have everything done, except for a few minor steps of the Generator method here it is:

    // The Gen n Method: Recursively Generates The Maze

    private void genFile(int startX, int startY, int endX, int endY) {
    Random gen = new Random();

    // *** BASES CASES ***

    // Check if we can divide the space

    boolean wallPossible = false;

    // Check all vertical wall placements

    for (int i = startX + 1; i < endX; i++) {
    if ( ((endY+1 < n) || maze[i][endY+1] != '_') &&
    ((startY-1 >= 0) || maze[i][startY-1] != '_') ) {

    // Do this when there is no wall opening mark on either side

    wallPossible = true;
    break;
    }
    }

    if (!wallPossible) {

    // Check all horizontal wall placements

    for (int i=startY+1; i<endY; i++) {
    if ( ((endX+1 < n) || maze[endX+1][i] != '_') &&
    ((startX-1 >= 0) || maze[startX-1][i] != '_') ) {

    // Do this when there is no wall opening mark on either side

    wallPossible = true;
    break;

    }
    }
    }

    if (!wallPossible) return;



    // *** RECURSIVE CASE ***
    // Once here, it means we can divide the space

    // Loop that keeps asking for direction and location for a wall until valid

    int dir = 0;
    int k = 0;

    do {

    // Pick a random direction

    dir = gen.nextInt(2);

    // Pick a random wall location

    if (dir == 0) {

    // Generate a random number between the boundaries
    // that will represent the (vertical) wall location

    k = gen.nextInt (endy - starty - 1) + starty + 1;

    } else {

    // Generate a random number between the boundaries
    // that will represent the (horizontal) wall location

    k = gen.nextInt(endY - startY - 1) + startY + 1;

    }

    // Check if valid

    //for (int i = startX + 1; i < endX; i++) {
    if (dir==0) {
    if ( ((endY+1 < n) || maze[k][endY+1] != '_') &&
    ((startY-1 >= 0) || maze[k][startY-1] != '_') ) {

    // Do this when there is no wall opening mark on either side

    wallPossible = true;
    break;
    }
    }

    else {

    // Check all horizontal wall placements

    if ( ((endX+1 < n) || maze[endX+1][k] != '_') &&
    ((startX-1 >= 0) || maze[startX-1][k] != '_') ) {

    // Do this when there is no wall opening mark on either side

    wallPossible = true;
    break;
    }
    }

    } while (!wallPossible);


    // Draw the wall

    if (dir==0)
    {
    for (int y = startY; y <= endY; y++)
    maze [k][y] = '*';

    }

    else {
    for (int x = startX; x <= endX; x++)
    maze[k][x] = '*';

    }

    // Pick a random passage location on the wall
    // Make the passage

    int r = gen.nextInt(endY-startY+1) + startY;

    if (dir == 0){
    maze [k][r] = '_';
    }
    else{
    maze [r][k] = '_';
    }

    // Recursively split the two spaces

    // Find the coordinates of the first space

    // Find the coordinates of the second space

    // Call genFile for both space
    // genFile( , , , );
    // genFile( , , , );



    The last steps that are underlined and in bold print are the last steps that I need to finish this method please help.

  2. The Following User Says Thank You to Deejay1992 For This Useful Post:

    tsharetlme (November 30th, 2012)


  3. #2
    Super Moderator curmudgeon's Avatar
    Join Date
    Aug 2012
    Posts
    1,130
    My Mood
    Cynical
    Thanks
    64
    Thanked 139 Times in 134 Posts

    Default Re: Recursive Maze Help

    Question triple posted! This one closed.

  4. The Following User Says Thank You to curmudgeon For This Useful Post:

    tsharetlme (November 30th, 2012)

Similar Threads

  1. Need some help printing out my maze!
    By erock618 in forum What's Wrong With My Code?
    Replies: 8
    Last Post: May 3rd, 2012, 05:50 PM
  2. Recursive Maze Help
    By chono in forum What's Wrong With My Code?
    Replies: 1
    Last Post: February 22nd, 2012, 08:02 PM
  3. BackTracking in a maze
    By skoon in forum What's Wrong With My Code?
    Replies: 2
    Last Post: January 26th, 2012, 10:23 AM
  4. Maze Game
    By whatsbruin in forum What's Wrong With My Code?
    Replies: 2
    Last Post: April 15th, 2011, 06:59 PM
  5. Recursion Maze
    By sman1234 in forum What's Wrong With My Code?
    Replies: 0
    Last Post: October 28th, 2010, 12:40 PM