unity 使用 随机普里姆算法(Randomized Prim) 生成迷宫

 unity 使用 随机普里姆算法 随机生成迷宫

下午闲着没事，继续上次的迷宫算法，鼓捣了一下Randomized Prim

效果图如下

参考如下文献：

https://en.wikipedia.org/wiki/Maze_generation_algorithm

话不多说，直接贴代码。

using System.Collections;
using System.Collections.Generic;
using UnityEngine;
using UnityEngine.UI;

public class RandomizedPrimBehaviour : MonoBehaviour
{
    public struct Cell
    {
        public int x;
        public int y;
        public int direction;

        public bool isVisited;
    }

    public int mapWidth;
    public int mapHeight;
    public Image imagePrefab;
    public Color bodyColor;
    public Color headColor;

    private Cell[,] cells;
    private Image[,] images;

    private List<Cell> cellList;
    private Queue<Cell> cellQueue;

    private Coroutine coroutine;
    // Use this for initialization
    void Start()
    {
        cellList = new List<Cell>();
        cellQueue = new Queue<Cell>();

        CreateAndInit();
        DoRandomizedPrim();
    }
    /// <summary>
    /// 创建和初始化
    /// </summary>
    private void CreateAndInit()
    {
        images = new Image[mapWidth, mapHeight];
        cells = new Cell[mapWidth, mapHeight];

        for (int i = 0; i < mapWidth; i++)
        {
            for (int j = 0; j < mapHeight; j++)
            {
                images[i, j] = Instantiate(imagePrefab, transform);
                images[i, j].rectTransform.anchoredPosition = new Vector2(i * imagePrefab.rectTransform.sizeDelta.x, j * imagePrefab.rectTransform.sizeDelta.y);

                cells[i, j].x = i;
                cells[i, j].y = j;
                cells[i, j].direction = -1;
                cells[i, j].isVisited = false;
            }
        }
    }
    /// <summary>
    /// Randomized Prim 
    /// </summary>
    private void DoRandomizedPrim()
    {
        int times = 0;

        int x = Random.Range(0, mapWidth);
        int y = Random.Range(0, mapHeight);

        cells[x, y].isVisited = true;

        AddNewCellsToList(x, y);

        cellQueue.Enqueue(cells[x, y]);

        while (cellList.Count > 0)
        {
            int listIndex = Random.Range(0, cellList.Count);

            int newX = -1, newY = -1;
            switch (cellList[listIndex].direction)
            {
                case 0:
                    if (cellList[listIndex].y + 1 < mapHeight && !cells[cellList[listIndex].x, cellList[listIndex].y + 1].isVisited)
                    {
                        newX = cellList[listIndex].x;
                        newY = cellList[listIndex].y + 1;
                    }
                    break;
                case 1:
                    if (cellList[listIndex].y - 1 >= 0 && !cells[cellList[listIndex].x, cellList[listIndex].y - 1].isVisited)
                    {
                        newX = cellList[listIndex].x;
                        newY = cellList[listIndex].y - 1;
                    }
                    break;
                case 2:
                    if (cellList[listIndex].x - 1 >= 0 && !cells[cellList[listIndex].x - 1, cellList[listIndex].y].isVisited)
                    {
                        newX = cellList[listIndex].x - 1;
                        newY = cellList[listIndex].y;
                    }
                    break;
                case 3:
                    if (cellList[listIndex].x + 1 < mapWidth && !cells[cellList[listIndex].x + 1, cellList[listIndex].y].isVisited)
                    {
                        newX = cellList[listIndex].x + 1;
                        newY = cellList[listIndex].y;
                    }
                    break;
                default:
                    print(cellList[listIndex].x + "_" + cellList[listIndex].y + " Fail");
                    break;
            }

            if (newX != -1 && newY != -1)
            {
                times++;

                AddNewCellsToList(newX, newY);

                cellQueue.Enqueue(cells[cellList[listIndex].x, cellList[listIndex].y]);
                cellQueue.Enqueue(cells[newX, newY]);

                cells[cellList[listIndex].x, cellList[listIndex].y].isVisited = true;
                cells[newX, newY].isVisited = true;
            }

            cellList.RemoveAt(listIndex);
        }
        print("times:" + times);
        coroutine = StartCoroutine(SlowShow());
    }
    /// <summary>
    /// 增加新cell进列表
    /// </summary>
    /// <param name="x"></param>
    /// <param name="y"></param>
    private void AddNewCellsToList(int x, int y)
    {
        if (y + 1 < mapHeight && !cells[x, y + 1].isVisited)
        {
            cells[x, y + 1].direction = 0;
            cellList.Add(cells[x, y + 1]);
        }

        if (y - 1 >= 0 && !cells[x, y - 1].isVisited)
        {
            cells[x, y - 1].direction = 1;
            cellList.Add(cells[x, y - 1]);
        }

        if (x - 1 >= 0 && !cells[x - 1, y].isVisited)
        {
            cells[x - 1, y].direction = 2;
            cellList.Add(cells[x - 1, y]);
        }

        if (x + 1 < mapWidth && !cells[x + 1, y].isVisited)
        {
            cells[x + 1, y].direction = 3;
            cellList.Add(cells[x + 1, y]);
        }
    }
    /// <summary>
    /// 延时显示
    /// </summary>
    /// <returns></returns>
    private IEnumerator SlowShow()
    {
        print("cellQueue.Count:" + cellQueue.Count);

        int lastX = -1, lastY = -1;

        while (cellQueue.Count > 0)
        {
            yield return new WaitForSecondsRealtime(0.1f);

            if (lastX != -1 && lastY != -1)
            {
                images[lastX, lastY].color = bodyColor;
            }

            Cell cell = cellQueue.Dequeue();
            images[cell.x, cell.y].color = headColor;

            lastX = cell.x;
            lastY = cell.y;
        }

        images[lastX, lastY].color = bodyColor;

        print("End");
        StopCoroutine(coroutine);
    }
}

工程文件如下： 

 https://files.cnblogs.com/files/JinT-Hwang/RandomizedPrim.7z

欢迎交流指教。