Programming : General : Dungeon Generation algorithm

#include <iostream> #include <fstream> #include "cstdlib" #include <ctime> #include <stdio.h> #include <termios.h> #include <string> using namespace std; int main() { const int mapx =22; const int mapy =82;//69; const int mapz =10; char map[mapx][mapy]= { " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " ", " " }; srand(time(NULL)); const unsigned int maxRooms=5; unsigned int roomCounter=0; unsigned int startX=1 +(rand()%(mapx-2)); unsigned int startY=1+(rand()%(mapy-5)); char floor='a'; char door='+'; //char wall='#'; char wall=' '; int length2; int randomPosy; int randomPosx; int width; int maxrandomPosy; int maxrandomPosx; int checker1=0; bool check1=false; int checker2=0; int check2=false; int checker3=0; bool check3=false; int checker4=0; bool check4=false; while(roomCounter<maxRooms) { if(roomCounter==0) { floor='1'; } if(roomCounter==1) { floor='2'; } if(roomCounter==2) { floor='3'; } if(roomCounter==3) { floor='4'; } if(roomCounter==4) { floor='5'; } length2=rand()% 5 + 5; randomPosy=1+rand()% 65; randomPosx=1+rand()% 14; width=rand()%3+4; maxrandomPosy=randomPosy+length2; maxrandomPosx=randomPosx+width; for(int a=randomPosy; a<=maxrandomPosy;a++) { if(map[randomPosx-1][a]==wall) { checker1++; } } if(checker1==maxrandomPosy-randomPosy+1) { check1=true; } for(int b=randomPosx; b<=maxrandomPosx;b++) { if(map[maxrandomPosy+1]==wall) { checker2++; } } if(checker2==maxrandomPosx-randomPosx+1) { check2=true; } for(int c=randomPosy; c<=maxrandomPosy;c++) { if(map[maxrandomPosx+1][c]==wall) { checker3++; } } if(checker3==maxrandomPosy-randomPosy+1) { check3=true; } for(int d=randomPosx; d<=maxrandomPosx;d++) { if(map[d][randomPosy-1]==wall) { checker4++; } } if(checker4==maxrandomPosx-randomPosx+1) { check4=true; } if(check1==true && check2==true && check3==true && check4 == true) { while(randomPosy<maxrandomPosy) { for(int c=randomPosx;c< maxrandomPosx;c++) { map[c][randomPosy]=floor; } randomPosy++; } ++roomCounter; } } //print map for(int m=0;m<mapx;m++) { cout <<map[m]<<endl; } return 0; }


// direction bits
enum { NORTH = 1, SOUTH = 2, EAST = 4, WEST = 8};

typedef struct 
  {
  byte exits;
  } room;

room rooms [WIDTH] [DEPTH] = { 0 };

const int getrandom (const int x)
{
long n;
 
   if (x <= 0)
     return 0;
   n = rand ();
   return (n % x);
}   // end of getrandom


/*------------------------------------------------------
                    Locations
  ------------------------------------------------------ */

// player/mob/item location
class loc
  {
  public:

    // default constructor
    loc () : x (0), y (0) {} 
    // copy constructor
    loc (const loc & rhs) : x (rhs.x), y (rhs.y) {}
    // constructor from coordinates
    loc (const byte newx, const byte newy) : x (newx), y ( newy) {}

    bool operator== (const loc & rhs) const;
    bool operator!= (const loc & rhs) const;

    void go (const byte direction);
    void rand ();

  byte x;
  byte y;
  };  // end of class loc

void loc::go (const byte direction)
  {
  switch (direction)
    {
    case NORTH: y--; break;
    case SOUTH: y++; break;
    case EAST:  x++; break;
    case WEST:  x--; break;
    } // end of switch

  } // end of loc::go

void loc::rand ()
  {
  x = getrandom (WIDTH);
  y = getrandom (DEPTH);
  } // end of loc::rand

bool loc::operator== (const loc & rhs) const
  {
  return x == rhs.x && y == rhs.y;
  }

bool loc::operator!= (const loc & rhs) const
  {
  return !(*this == rhs);
  }


/*------------------------------------------------------
                    Dungeon generation
  ------------------------------------------------------ */

// generate the maze
void MakePassage (loc where)
  {
  int exits [4] = { NORTH, SOUTH, EAST, WEST };
  shuffle (exits, 4);

  // make an exit in each direction, if the room in
  // that direction does not already have one
  for (int i = 0; i < 4; i++)
    {
    loc newloc (where);
    byte chosenExit = exits [i];
    newloc.go (chosenExit);

    if (newloc.x >= 0 && newloc.x < WIDTH &&
       newloc.y >= 0 && newloc.y < DEPTH &&
       rooms [newloc.x] [newloc.y].exits == 0)
     {
     rooms [where.x] [where.y].exits |= chosenExit;  // make an exit this way
     rooms [newloc.x] [newloc.y].exits |= opposite (chosenExit); // and the reverse exit
     MakePassage (newloc);
     }  // end of exit in range and room not yet processed

    }  // end of for
  } // end of  MakePassage

Gammon Software Solutions forum