更新日期2026年8月6日。项目源码获取源码。索引关卡生成算法关卡生成种子一、关卡中的地块分类二、关卡的大小三、关卡生成算法的流程1.初始化算法数据2.随机撒种子3.计算地块的目标格子数4.种子并行生长5.边缘优化6.生成玩家老巢关卡生成算法在序章中有一个夸张说法我们的TankBattle联机坦克大战拥有多达2147483647个的超多关卡int型的上限事实上只是因为关卡生成算法采用了一个int型作为种子就像我的世界那样提供一个相同的生成种子将生成一个完全一样的世界。关卡生成种子那么在此之前必须通过关卡种子来定义一个随机器/// summary/// 关卡地图的随机器LevelSeed为关卡种子比如第一关是1第二关是2....../// /summarypublicSystem.RandomMapRandom{get;privateset;}newSystem.Random(LevelSeed);注意在任何设备、任何环境下通过这个种子生成出来的关卡都必须是一模一样的。一、关卡中的地块分类关卡中的地块共有7个类型地块类型地块编号地块功能地块图像空白0坦克和子弹可穿过砖墙1坦克不可穿过子弹可销毁钢板2坦克不可穿过子弹可销毁需玩家坦克达到3星森林3坦克和子弹可穿过但会被遮挡视野海水4坦克不可穿过子弹可穿过雪地5坦克和子弹可穿过但坦克会打滑玩家老巢6坦克不可穿过子弹可销毁定义地块类型BlockType如下/// summary/// 地块类型/// /summarypublicenumBlockType{/// summary/// 空白/// /summaryNone0,/// summary/// 砖墙/// /summaryBrickWall1,/// summary/// 钢板/// /summarySteelPlate2,/// summary/// 森林/// /summaryForest3,/// summary/// 海水/// /summarySeawater4,/// summary/// 雪地/// /summarySnowfield5,/// summary/// 玩家老巢/// /summaryLair6}二、关卡的大小关卡的大小地块数量为13*13保持跟原版一致地块的索引为左下角0,0右上角12,12/// summary/// 地图行数/// /summarypublicstaticreadonlyintRows13;/// summary/// 地图列数/// /summarypublicstaticreadonlyintCols13;基于此我们先创建一个可以代表整个关卡地图的二维数组//初始化空白地图BlockType[,]mapnewBlockType[Rows,Cols];for(intr0;rRows;r){for(intc0;cCols;c){map[r,c]BlockType.None;}}三、关卡生成算法的流程我们的关卡生成算法流程如下1.初始化算法数据2.随机撒种子3.计算地块的目标格子数4.种子并行生长5.边缘优化6.生成玩家老巢1.初始化算法数据定义关卡生成算法所需要用到的数据和字段/// summary/// 聚集因子控制地形成片程度40~80之间值越大越聚集/// /summaryprivateconstintClusterFactor65;/// summary/// 地块的权重数值越大该地块越多/// /summaryprivatereadonlyDictionaryBlockType,intBlockWeightsnewDictionaryBlockType,int();/// summary/// 生成地图的例外区域玩家出生点、敌人出生点、玩家老巢等/// /summaryprivatereadonlyHashSet(introw,intcol)ExceptionZonesnewHashSet(int,int)();/// summary/// 所有地块的种子数量/// /summaryprivateDictionaryBlockType,Queue(introw,intcol)_blockSeedsnewDictionaryBlockType,Queue(introw,intcol)();/// summary/// 所有地块的目标格子数/// /summaryprivateDictionaryBlockType,int_blockTargetCountnewDictionaryBlockType,int();/// summary/// 所有地块的当前格子数/// /summaryprivateDictionaryBlockType,int_blockCurrentCountnewDictionaryBlockType,int();/// summary/// 邻居地块缓存队列/// /summaryprivateList(introw,intcol)_neighborCachenewList(introw,intcol)();定义各个地块的权重砖墙最多钢板和森林次之//地块的权重数值越大该地块越多BlockWeights.Add(BlockType.BrickWall,40);BlockWeights.Add(BlockType.SteelPlate,15);BlockWeights.Add(BlockType.Forest,15);BlockWeights.Add(BlockType.Seawater,10);BlockWeights.Add(BlockType.Snowfield,5);定义例外区域玩家老巢、玩家出生点、敌人出生点为例外区域不会在这些区域生成地块//玩家老巢及周边保护区域ExceptionZones.Add((5,0));ExceptionZones.Add((5,1));ExceptionZones.Add((6,0));ExceptionZones.Add((6,1));ExceptionZones.Add((7,0));ExceptionZones.Add((7,1));//玩家出生点ExceptionZones.Add((4,0));ExceptionZones.Add((8,0));//敌人出生点ExceptionZones.Add((0,12));ExceptionZones.Add((6,12));ExceptionZones.Add((12,12));然后在每一轮关卡生成前初始化相关数据//重置地图数据_blockSeeds[BlockType.BrickWall].Clear();_blockSeeds[BlockType.SteelPlate].Clear();_blockSeeds[BlockType.Forest].Clear();_blockSeeds[BlockType.Seawater].Clear();_blockSeeds[BlockType.Snowfield].Clear();_blockTargetCount[BlockType.BrickWall]0;_blockTargetCount[BlockType.SteelPlate]0;_blockTargetCount[BlockType.Forest]0;_blockTargetCount[BlockType.Seawater]0;_blockTargetCount[BlockType.Snowfield]0;_blockCurrentCount[BlockType.BrickWall]0;_blockCurrentCount[BlockType.SteelPlate]0;_blockCurrentCount[BlockType.Forest]0;_blockCurrentCount[BlockType.Seawater]0;_blockCurrentCount[BlockType.Snowfield]0;_neighborCache.Clear();2.随机撒种子先根据权重值在地图上随机撒种子权重值越高种子越多/// summary/// 随机撒种子/// /summary/// param namemap地图/param/// param nameblockType种子地块类型/paramprivatevoidSeeding(BlockType[,]map,BlockTypeblockType){//根据权重决定种子数量至少1颗intnumSeedsMath.Max(1,BlockWeights[blockType]/5);//播种所有种子for(intm0;mnumSeeds;m){//每一个种子尝试播种200次for(intattempt0;attempt200;attempt){//使用关卡种子随机器MapRandomintrMapRandom.Next(0,Rows);intcMapRandom.Next(0,Cols);//排除非空地块if(map[r,c]!BlockType.None)continue;//排除例外区域if(ExceptionZones.Contains((r,c)))continue;//排除距离例外区域太近的距离小于等于1格if(IsTooCloseOfExceptionZones(r,c))continue;//种下种子map[r,c]blockType;_blockSeeds[blockType].Enqueue((r,c));break;}}}将5种类型的地块种子都撒下//随机撒种子Seeding(map,BlockType.BrickWall);Seeding(map,BlockType.SteelPlate);Seeding(map,BlockType.Forest);Seeding(map,BlockType.Seawater);Seeding(map,BlockType.Snowfield);撒下种子后大概就是如下这样3.计算地块的目标格子数在种子生长前我们先计算所有地块的最终数目以控制种子生长上限/// summary/// 计算地块的目标格子数/// /summary/// param nameblockType种子地块类型/paramprivatevoidCalculateTargetCount(BlockTypeblockType){//总的可生成地块数量预留10个空白inttotalBlockRows*Cols-ExceptionZones.Count-10;//填充比例doublefillRatio0.55;//总的地块权重intsumWeightsBlockWeights.Values.Sum();//计算地块的目标格子数保底4个inttarget(int)(totalBlock*(BlockWeights[blockType]/(double)sumWeights)*fillRatio);_blockTargetCount[blockType]Math.Max(4,target);}计算5种类型的地块最终数目//计算地块的目标格子数CalculateTargetCount(BlockType.BrickWall);CalculateTargetCount(BlockType.SteelPlate);CalculateTargetCount(BlockType.Forest);CalculateTargetCount(BlockType.Seawater);CalculateTargetCount(BlockType.Snowfield);4.种子并行生长最核心的环节就是让所有种子并行生长向邻居地块生长/// summary/// 地块种子生长/// /summary/// param namemap地图/param/// param nameblockType种子地块类型/param/// returns是否存在任意一个地块生长成功/returnsprivateboolSeedGrowth(BlockType[,]map,BlockTypeblockType){boolanyGrowthfalse;//如果已生长到目标数量则不再生长if(_blockCurrentCount[blockType]_blockTargetCount[blockType])returnanyGrowth;//如果种子数量为零则不再生长if(_blockSeeds[blockType].Count0)returnanyGrowth;//取出一个种子(introw,intcol)seed_blockSeeds[blockType].Dequeue();//获取其邻居地块_neighborCache.Clear();_neighborCache.Add((seed.row-1,seed.col-1));_neighborCache.Add((seed.row-1,seed.col));_neighborCache.Add((seed.row-1,seed.col1));_neighborCache.Add((seed.row,seed.col-1));_neighborCache.Add((seed.row,seed.col1));_neighborCache.Add((seed.row1,seed.col-1));_neighborCache.Add((seed.row1,seed.col));_neighborCache.Add((seed.row1,seed.col1));//向邻居地块生长for(inti0;i_neighborCache.Count;i){//如果已生长到目标数量则不再生长if(_blockCurrentCount[blockType]_blockTargetCount[blockType])break;intr_neighborCache[i].row;intc_neighborCache[i].col;//生长位置为有效区域if(r0rRowsc0cCols){//排除非空地块if(map[r,c]!BlockType.None)continue;//排除例外区域if(ExceptionZones.Contains((r,c)))continue;//以ClusterFactor的概率扩散if(MapRandom.IsTriggerProbability(ClusterFactor)){//生长成功map[r,c]blockType;_blockCurrentCount[blockType];_blockSeeds[blockType].Enqueue((r,c));anyGrowthtrue;}}}returnanyGrowth;}所有种子共生长2000次这个值不固定只是我根据情况微调的结果//地块种子并行生长生长2000次_blockCurrentCount[BlockType.BrickWall]_blockSeeds[BlockType.BrickWall].Count;_blockCurrentCount[BlockType.SteelPlate]_blockSeeds[BlockType.SteelPlate].Count;_blockCurrentCount[BlockType.Forest]_blockSeeds[BlockType.Forest].Count;_blockCurrentCount[BlockType.Seawater]_blockSeeds[BlockType.Seawater].Count;_blockCurrentCount[BlockType.Snowfield]_blockSeeds[BlockType.Snowfield].Count;intnumGrowth2000;for(inti0;inumGrowth;i){boolbrickWallGrowthSeedGrowth(map,BlockType.BrickWall);boolsteelPlateGrowthSeedGrowth(map,BlockType.SteelPlate);boolforestGrowthSeedGrowth(map,BlockType.Forest);boolseawaterGrowthSeedGrowth(map,BlockType.Seawater);boolsnowfieldGrowthSeedGrowth(map,BlockType.Snowfield);//如果没有任何生长发生则提前结束if(!brickWallGrowth!steelPlateGrowth!forestGrowth!seawaterGrowth!snowfieldGrowth){break;}}为了让各个地块区域砖墙区、海水区等看起来更连贯、更成片而不是抛玉米般分散一地所以各个类型的地块种子是并行生长的你生长一次我生长一次由聚集因子决定了生长的成功率一次完整的生长后地图变成了如下这样看起来比纯粹的随机每一个地块随机一下自己的类型更有可玩性。5.边缘优化生长完成后补充一个边缘优化算法旨在将边缘的海水和钢板转为空白40%几率转化提高可玩性//边缘优化边缘的海水和钢板转为空白提高可玩性for(intr0;rRows;r){if(map[r,0]BlockType.Seawater||map[r,0]BlockType.SteelPlate){if(MapRandom.IsTriggerProbability(40))map[r,0]BlockType.None;}if(map[r,Cols-1]BlockType.Seawater||map[r,Cols-1]BlockType.SteelPlate){if(MapRandom.IsTriggerProbability(40))map[r,Cols-1]BlockType.None;}}for(intc0;cCols;c){if(map[0,c]BlockType.Seawater||map[0,c]BlockType.SteelPlate){if(MapRandom.IsTriggerProbability(40))map[0,c]BlockType.None;}if(map[Rows-1,c]BlockType.Seawater||map[Rows-1,c]BlockType.SteelPlate){if(MapRandom.IsTriggerProbability(40))map[Rows-1,c]BlockType.None;}}因为边缘是敌方坦克的主要移动区域所以其应该更通畅。6.生成玩家老巢最后生成玩家的老巢区域就大功告成了//生成玩家老巢及保护地块map[5,0]BlockType.BrickWall;map[5,1]BlockType.BrickWall;map[6,0]BlockType.Lair;map[6,1]BlockType.BrickWall;map[7,0]BlockType.BrickWall;map[7,1]BlockType.BrickWall;当然我们会发现问题所在玩家老巢的保护地块应该都是半砖不过这与关卡生成算法无关其涉及到地块的真实创建与分片后续再来处理它吧。