找到最小数量的墙

我正在制作一个游戏，其中的墙是由方形块制成的。墙被放置在二维网格上，如下所示：

[X][X][X][X]
[ ][X][ ][ ]
[ ][X][ ][ ]
[ ][X][ ][ ]

现在，当我优化碰撞检测时，它有助于将墙壁数量减少到最低限度。在上述情况下，有七个墙块，但如果这些块组合在一起，则只有两个墙。我很难找到一个最佳解决方案来找到这些组合墙，并根据搜索开始的块获得不同的结果（块存储在无序列表中，顺序来自于它们在编辑器中的排列顺序）。你对如何解决这个问题有什么想法吗？这应该是非常初级的东西，但是，你知道，现在是星期五，我不能正常工作。：）

这是我目前的次优代码，它基本上做了两次检查，包括水平和垂直的"连续性"，然后检查哪一个更好。它还存储"已经处理过"的墙块，这样它们就不会被识别两次，但这当然会让它在交叉点变得时髦。

public void CreateCollidersForExport()
{
    List<Wall> handledWalls = new List<Wall>();
    foreach (Wall w in walls)
    {
        if (handledWalls.Contains(w)) continue;
        handledWalls.Add(w);
        // Search how many walls there is horizontally
        Vector3 horizontalCenter = new Vector3(w.X, w.Y, w.Z);
        List<Wall> tmpWallsHorizontal = new List<Wall>();
        tmpWallsHorizontal.Add(w);
        foreach (Wall other in walls)
        {
            if (handledWalls.Contains(other) || tmpWallsHorizontal.Contains(other)) continue;
            bool canAdd = false;
            foreach (Wall _w in tmpWallsHorizontal)
            {
                if (other.X == _w.X + Wall.size && other.Y == _w.Y && other.Z == _w.Z)
                {
                    canAdd = true;
                    horizontalCenter.X += Wall.size / 2;
                    break;
                }
                else if (other.X == _w.X - Wall.size && other.Y == _w.Y && other.Z == _w.Z)
                {
                    canAdd = true;
                    horizontalCenter.X -= Wall.size / 2;
                    break;
                }
            }
            if (canAdd)
            {
                tmpWallsHorizontal.Add(other);
            }
        }
        // Search how many walls there is vertically
        Vector3 verticalCenter = new Vector3(w.X, w.Y, w.Z);
        List<Wall> tmpWallsVertical = new List<Wall>();
        tmpWallsVertical.Add(w);
        foreach (Wall other in walls)
        {
            if (handledWalls.Contains(other) || tmpWallsVertical.Contains(other)) continue;
            bool canAdd = false;
            foreach (Wall _w in tmpWallsVertical)
            {
                if (other.X == _w.X && other.Y == _w.Y && other.Z == _w.Z + Wall.size)
                {
                    canAdd = true;
                    verticalCenter.Z += Wall.size / 2;
                    break;
                }
                else if (other.X == _w.X && other.Y == _w.Y && other.Z == _w.Z - Wall.size)
                {
                    canAdd = true;
                    verticalCenter.Z -= Wall.size / 2;
                    break;
                }
            }
            if (canAdd)
            {
                tmpWallsVertical.Add(other);
            }
        }
        if (tmpWallsHorizontal.Count > tmpWallsVertical.Count)
        {
            // tmpWallsHorizontal has the longest "wall" now
        }
        else if (tmpWallsVertical.Count > tmpWallsHorizontal.Count)
        {
            // tmpWallsVertical has the longest "wall" now
        }
        else
        {
            // Both ways are the same length
        }
    }
}