private void RemoveWall(MazeGeneratorCellMP a, MazeGeneratorCellMP b)
{
if (a.X == b.X)
{
if (a.Y > b.Y)
{
a.WallBottom = false;
}
else
{
b.WallBottom = false;
}
}
else
{
if (a.X > b.X)
{
a.WallLeft = false;
}
else
{
b.WallLeft = false;
}
}
}
public MazeMP GenerateMaze()
{
MazeGeneratorCellMP[,] cells = new MazeGeneratorCellMP[Width, Height];
for (int x = 0; x < cells.GetLength(0); x++)
{
for (int y = 0; y < cells.GetLength(1); y++)
{
cells[x, y] = new MazeGeneratorCellMP {
X = x, Y = y
};
}
}
for (int x = 0; x < cells.GetLength(0); x++)
{
cells[x, Height - 1].WallLeft = false;
}
for (int y = 0; y < cells.GetLength(1); y++)
{
cells[Width - 1, y].WallBottom = false;
}
RemoveWallsWithBacktracker(cells);
MazeMP maze = new MazeMP();
maze.cells = cells;
maze.finishPosition = PlaceMazeExit(cells);
return(maze);
}
private void RemoveWallsWithBacktracker(MazeGeneratorCellMP[,] maze)
{
MazeGeneratorCellMP current = maze[0, 0];
current.Visited = true;
current.DistanceFromStart = 0;
Stack <MazeGeneratorCellMP> stack = new Stack <MazeGeneratorCellMP>();
do
{
List <MazeGeneratorCellMP> unvisitedNeighbours = new List <MazeGeneratorCellMP>();
int x = current.X;
int y = current.Y;
if (x > 0 && !maze[x - 1, y].Visited)
{
unvisitedNeighbours.Add(maze[x - 1, y]);
}
if (y > 0 && !maze[x, y - 1].Visited)
{
unvisitedNeighbours.Add(maze[x, y - 1]);
}
if (x < Width - 2 && !maze[x + 1, y].Visited)
{
unvisitedNeighbours.Add(maze[x + 1, y]);
}
if (y < Height - 2 && !maze[x, y + 1].Visited)
{
unvisitedNeighbours.Add(maze[x, y + 1]);
}
if (unvisitedNeighbours.Count > 0)
{
MazeGeneratorCellMP chosen = unvisitedNeighbours[UnityEngine.Random.Range(0, unvisitedNeighbours.Count)];
RemoveWall(current, chosen);
chosen.Visited = true;
stack.Push(chosen);
chosen.DistanceFromStart = current.DistanceFromStart + 1;
current = chosen;
}
else
{
current = stack.Pop();
}
} while (stack.Count > 0);
}
private Vector2Int PlaceMazeExit(MazeGeneratorCellMP[,] maze)
{
MazeGeneratorCellMP furthest = maze[0, 0];
for (int x = 0; x < maze.GetLength(0); x++)
{
if (maze[x, Height - 2].DistanceFromStart > furthest.DistanceFromStart)
{
furthest = maze[x, Height - 2];
}
if (maze[x, 0].DistanceFromStart > furthest.DistanceFromStart)
{
furthest = maze[x, 0];
}
}
for (int y = 0; y < maze.GetLength(1); y++)
{
if (maze[Width - 2, y].DistanceFromStart > furthest.DistanceFromStart)
{
furthest = maze[Width - 2, y];
}
if (maze[0, y].DistanceFromStart > furthest.DistanceFromStart)
{
furthest = maze[0, y];
}
}
if (furthest.X == 0)
{
furthest.WallLeft = false;
}
else if (furthest.Y == 0)
{
furthest.WallBottom = false;
}
else if (furthest.X == Width - 2)
{
maze[furthest.X + 1, furthest.Y].WallLeft = false;
}
else if (furthest.Y == Height - 2)
{
maze[furthest.X, furthest.Y + 1].WallBottom = false;
}
return(new Vector2Int(furthest.X, furthest.Y));
}
