This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Quote from: Cerno on Wed 08/05/2013 23:26:17
Since there is so much interest in the theme and with all these other competitions going on, maybe you can get this month's MAGS extended to next month? Or would that violate the rules?
//Rooms are referred to as 'cells'
struct Cell
{
int door[4]; // Exit to the neighbouring cell. 0 = north, 1 = east, 2 = south, 3 = west. E.g. cell[1].door[0] = 2 leads to cell 2 at its northern edge
int x, y; // Cells are on a grid system
};
function DungeonGenerate(int quan) // quan is how many cells will be in the entire dungeon
{
// The number of the cell for given coords is stored: e.g. x[5].y[7] = 5 (cell 5 is at x5,y7)
struct Coord
{
int y[16];
};
Coord x[16];
// the grid runs from 0-15 on both axes
int i = 1; // start with 1, because cell[0] is never used. cell[1] is the starting room
// RESET all the cells, because the function can be called more than once
while (i <= quan)
{
cell[i].door[0] = 0; cell[i].door[1] = 0; cell[i].door[2] = 0; cell[i].door[3] = 0;
cell[i].x = 0; cell[i].y = 0;
i++;
}
i = 1;
// Now we can start building the dungeon (and get problems)
cell[1].x = 8; cell[1].y = 8;
x[8].y[8] = 1; // starting cell is at the centre: x8,y8
while (i <= quan)
{
int exits = Random(3)+1; // Randomise how many exits this cell will have (must have at least one, max 4...)
int o = 1; // Now, cycle through up to this number of exits
while (o <= exits) {
int d = Random(3); // Randomise the direction of the exit (0=N, 1=E, 2=S, 3=W)
if (d == 0 && cell[i].y < 15) // NORTH, and cell isn't at northern edge
{
if (!x[cell[i].x].y[cell[i].y+1]) // There is no cell present at the coord to the north, so there can be a cell added there
{
// !! NOTE !! the new cell index is i+o, because exits might be greater than 1. So we need to keep adding new cells, up to this maximum
cell[i].door[0] = o; cell[i+o].door[2] = i; // The N door of current and S door of new are linked
cell[i+o].x = cell[i].x; cell[i+o].y = cell[i].y+1;
x[cell[i].x].y[cell[i].y+1] = o; // New cell placed at these coords
o++;
}
}
else if (d == 1 && cell[i].x < 15) // EAST, and cell isn't at eastern edge
{
if (!x[cell[i].x+1].y[cell[i].y]) // There is no cell present at the coord to the east, so there can be a cell added there
{
cell[i].door[1] = o; cell[i+o].door[3] = i; // The E door of current and W door of new are linked
cell[i+o].x = cell[i].x+1; cell[i+o].y = cell[i].y;
x[cell[i].x+1].y[cell[i].y] = o; // New cell placed at these coords
o++;
}
}
else if (d == 2 && cell[i].y) // SOUTH, and cell isn't at southern edge
{
if (!x[cell[i].x].y[cell[i].y-1]) // There is no cell present at the coord to the south, so there can be a cell added there
{
cell[i].door[2] = o; cell[i+o].door[0] = i; // The S door of current and N door of new are linked
cell[i+o].x = cell[i].x; cell[i+o].y = cell[i].y-1;
x[cell[i].x].y[cell[i].y-1] = o; // New cell placed at these coords
o++;
}
}
else if (d == 3 && cell[i].x) // WEST, and cell isn't at western edge
{
if (!x[cell[i].x-1].y[cell[i].y]) // There is no cell present at the coord to the west, so there can be a cell added there
{
cell[i].door[3] = o; cell[i+o].door[1] = i; // The W door of current and E door of new are linked
cell[i+o].x = cell[i].x-1; cell[i+o].y = cell[i].y;
x[cell[i].x-1].y[cell[i].y] = o; // New cell placed at these coords
o++;
}
}
}
i++;
}
current = 1; //set the starting room to 1.
}
Quote from: Baron on Wed 01/05/2013 01:37:24
I'm not on Steam and I don't really have spare time as such, so... reluctantly... I'm going to have to give up the X-COM prize to Chef/Stupot.
