public
anonymous / gist:828805
Last active

  • Download Gist
gistfile1.cs
C#
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
 
namespace Maze.Logic
{
[Flags]
public enum Directions
{
N = 1,
S = 2,
E = 4,
W = 8
}
 
public class Grid
{
private const int _rowDimension = 0;
private const int _columnDimension = 1;
 
public int MinSize { get; private set; }
public int MaxSize { get; private set; }
public int[,] Cells { get; private set; }
 
public Grid() : this(3, 3)
{
 
}
 
public Grid(int rows, int columns)
{
MinSize = 3;
MaxSize = 10;
Cells = Initialise(rows, columns);
}
 
public int[,] Initialise(int rows, int columns)
{
if (rows < MinSize)
rows = MinSize;
 
if (columns < MinSize)
columns = MinSize;
 
if (rows > MaxSize)
rows = MaxSize;
 
if (columns > MaxSize)
columns = MaxSize;
 
var cells = new int[rows, columns];
 
for (int i = 0; i < rows; i++)
{
for (int j = 0; j < columns; j++)
{
cells[i, j] = 0;
}
}
 
return cells;
}
 
private Dictionary<Directions, int> DirectionX = new Dictionary<Directions, int>
{
{ Directions.N, 0 },
{ Directions.S, 0 },
{ Directions.E, 1 },
{ Directions.W, -1 }
};
 
private Dictionary<Directions, int> DirectionY = new Dictionary<Directions, int>
{
{ Directions.N, -1 },
{ Directions.S, 1 },
{ Directions.E, 0 },
{ Directions.W, 0 }
};
 
private Dictionary<Directions, Directions> Opposite = new Dictionary<Directions, Directions>
{
{ Directions.N, Directions.S },
{ Directions.S, Directions.N },
{ Directions.E, Directions.W },
{ Directions.W, Directions.E }
};
 
public int[,] Generate()
{
var cells = Cells;
CarvePassagesFrom(0, 0, ref cells);
return cells;
}
 
public void CarvePassagesFrom(int currentX, int currentY, ref int[,] grid)
{
var directions = new List<Directions>
{
Directions.N,
Directions.S,
Directions.E,
Directions.W
}
.OrderBy(x => Guid.NewGuid());
 
foreach (var direction in directions)
{
var nextX = currentX + DirectionX[direction];
var nextY = currentY + DirectionY[direction];
 
if (IsOutOfBounds(nextX, nextY, grid))
continue;
 
if (grid[nextY, nextX] != 0) // has been visited
continue;
 
grid[currentY, currentX] |= (int)direction;
grid[nextY, nextX] |= (int)Opposite[direction];
 
CarvePassagesFrom(nextX, nextY, ref grid);
}
}
 
private bool IsOutOfBounds(int x, int y, int[,] grid)
{
if (x < 0 || x > grid.GetLength(_rowDimension) - 1)
return true;
 
if (y < 0 || y > grid.GetLength(_columnDimension) - 1)
return true;
 
return false;
}
 
public void Print(int[,] grid)
{
var rows = grid.GetLength(_rowDimension);
var columns = grid.GetLength(_columnDimension);
// Top line
Console.Write(" ");
for (int i = 0; i < columns; i++)
Console.Write(" _");
Console.WriteLine();
 
for (int y = 0; y < rows; y++)
{
Console.Write(" |");
 
for (int x = 0; x < columns; x++)
{
var directions = (Directions)grid[y, x];
 
var s = directions.HasFlag(Directions.S) ? " " : "_";
 
Console.Write(s);
 
s = directions.HasFlag(Directions.E) ? " " : "|";
 
Console.Write(s);
}
 
Console.WriteLine();
}
}
}
}

Please sign in to comment on this gist.

Something went wrong with that request. Please try again.