Creating a Maze using Java

Question

Im using Java to create a maze of specified "rows" and "columns" over each other to look like a grid. I plan to use a depth-first recursive method to "open the doors" between the rooms (the box created by the rows and columns).

I need help writing a openDoor method that will break the link between rooms.

Before writing an openDoor method, we need a couple of basic objects that describe the room and the relationship between them (the doors?). Can you show your definition of the maze in terms of data objects? — Marc
– Marc, Commented Jun 2, 2010 at 7:29
I am wanting to create the maze and then later find a way through it. Tho at the moment I am stuck on writing the method to openDoors between "rooms". — user356184
– user356184, Commented Jun 2, 2010 at 8:04
Im parsing in the current row and column along with the direction (North East South West) into my method. I also have the total number of rows and columns in the class. Is this what you mean? — user356184
– user356184, Commented Jun 2, 2010 at 8:04

Syprien · Accepted Answer · 2010-06-02 07:45:55Z

1

try something like this : example

answered Jun 2, 2010 at 7:45

Syprien

3562 silver badges6 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

trashgod · Accepted Answer · 2010-06-02 15:35:19Z

1

Because you mention depth-first(-search) (DFS) I assume, your maze is a graph where nodes represent rooms. The nodes are connected if there is an unlocked door between rooms. The graph may be cyclic.

You have a start room and may be looking for something in the maze. So you enter a room, check every door, whether it is unlocked or you have key that fits and open every possible door. You may find a key. Then you add that key to your keyring and restart in the start room.

Formally (adapted from de:wikipedia; see also en.wikipedia):

DFS(node, goal)
{
  if (node == goal)
    return node;
  else if (node.contains(newKey)) 
  {
    addToKeyRing(newKey);
    resetMaze();
    DFS(startRoom, goal);
  } else 
  {
    stack := expand (node) // all unvisited rooms that can be entered pushed on stack
    while (stack is not empty)
    {
      node' := pop(stack);
      DFS(node', goal);
    }
  }
}

edited Jun 2, 2010 at 15:35

trashgod

206k33 gold badges264 silver badges1.1k bronze badges

answered Jun 2, 2010 at 7:52

Andreas Dolk

115k20 gold badges185 silver badges275 bronze badges

1 Comment

Andreas Dolk Over a year ago

Thanks :) Yes, the links are the ones I used for the answer.

Collectives™ on Stack Overflow

Creating a Maze using Java

2 Answers 2

Comments

1 Comment

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

1 Comment

Your Answer

Sign up or log in

Post as a guest

Related