Question

我正在尝试使用递归制作迷宫生成器。它不起作用应该如何工作，我试图找出错误所在。因此，我想逐步进行递归1迭代。我该怎么做？

private void DevideRecursive(int pMinX, int pMaxX, int pMinY, int pMaxY)
{
    int randomX = Random.Range(pMinX +1, pMaxX);
    int randomY = Random.Range(pMinY +1, pMaxY);
    int randomWall = Random.Range(0, 4);

    List<GameObject> WalllistX1 = new List<GameObject>();
    List<GameObject> WalllistX2 = new List<GameObject>();
    List<GameObject> WalllistY1 = new List<GameObject>();
    List<GameObject> WalllistY2 = new List<GameObject>();
    List<List<GameObject>> MainWallList = new List<List<GameObject>>();

    MainWallList.Add(WalllistX1);
    MainWallList.Add(WalllistX2);
    MainWallList.Add(WalllistY1);
    MainWallList.Add(WalllistY2);

    //// add a wall on a random x coordinate
    for (int x = pMinX; x < pMaxX; x++)
    {
        GameObject wall = Instantiate(WallHor);
        wall.transform.position = new Vector2(tilesize * x + tilesize / 2, tilesize * randomY);
        if (x < randomX)
        {
            WalllistX1.Add(wall);
        }
        else
        {
            WalllistX2.Add(wall);
        }
    }
    //// add a wall on a random y coordinate
    for (int y = pMinY; y < pMaxY ; y++)
    {
        GameObject wall = Instantiate(WallVer);
        wall.transform.position = new Vector2(tilesize * randomX, tilesize * y + tilesize / 2);
        if (y < randomY)
        {
            WalllistY1.Add(wall);
        }
        else
        {
            WalllistY2.Add(wall);
        }
    }

    //make a hole in 3 out of tht 4 walls randomly
    for (int i = 0; i < MainWallList.Count; i++)
    {
        if (randomWall != i)
        {
            RemoveWall(MainWallList[i]);
        }
    }

    ////
    ////
    //// If either of the walls have a cell with only 1 grid stop the recursion


    Debug.Log("randomX - pMinX:" + (randomX - pMinX));
    Debug.Log("pMaxY - randomY:" + (pMaxY - randomY));
    Debug.Log("pMaxX - randomX:" + (pMaxX - randomX));
    Debug.Log("randomY - pMinY:" + (randomY - pMinY));

    if (!(randomX - pMinX <= 1) || !(pMaxY - randomY <= 1))
    {
        Debug.Log("a");
        DevideRecursive(pMinX, randomX, randomY, pMaxY);
    }
    else
    {
        return;
    }

    if (!(pMaxX - randomX <= 1) || !(pMaxY - randomY <= 1))
    {
        Debug.Log("b");
        DevideRecursive(randomX, pMaxX, randomY, pMaxY);
    }
    else
    {
        return;
    }

    if (!(randomX - pMinX <= 1 )|| !(randomY - pMinY <= 1))
    {
        Debug.Log("c");
        DevideRecursive(pMinX, randomX, pMinY, randomY);
    }
    else
    {
        return;
    }

    if (!(pMaxX - randomX <= 1) || !(randomY - pMinY <= 1))
    {
        Debug.Log("d");
        DevideRecursive(randomX, pMaxX, pMinY, randomY);
    }
    else
    {
        return;
    }
}

这是我的递归方法。在启动函数中调用它。该方法创建2个随机墙（1个垂直墙，1个水平墙）。将房间划分为4个较小的房间。然后对那些房间做同样的事情。

需要任何帮助

Answer 1

您可以修改函数以使用async。

using System.Threading.Tasks;
void Start () {
    DevideRecursive( ..params.. );
}
private async void DevideRecursive(int pMinX, int pMaxX, int pMinY, int pMaxY) {
    // code
    while (!Input.GetKeyDown(KeyCode.Space))
        await Task.Yield ();
    // code
    DevideRecursive( .. params .. );
    return
}

有关Unity here中的aysnc的更多信息。也可以使用IEnumerator，它使您可以选择从外部控制功能。

如何在Unity C＃中调试递归函数

1 个答案: