Itms/0ad
1
0
Fork 0
forked from 0ad/0ad
Code Pull Requests Activity

further optimizations for map Unknown: Passes

Browse Source 
Patch By: elexis
Transferred By: marder
aids 50fefd0605
Differential Revision: D4526
This was SVN commit r26586.
This commit is contained in:
bb 2022-03-06 21:30:19 +00:00
parent db7894ff6b
commit 6a9a17606c
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
binaries/data/mods/public/maps/random/unknown.js
View File

@ -638,15 +638,14 @@ function unknownPasses()
}
g_Map.log("Creating passages between neighboring players");
const passes = distributePointsOnCircle(numPlayers * 3, startAngle, fractionToTiles(0.35), mapCenter)[0];
for (let i = 0; i < numPlayers; ++i)
const passes = numPlayers == 2 && distributePointsOnCircle(numPlayers * 3, startAngle, fractionToTiles(0.35), mapCenter)[0];
for (let i = 0; i < numPlayers && numPlayers > 1; ++i)
{
// Create one pass between each neighboring base, create two passes in the case of two players.
// Notice we can't use the passes formula for n > 2 because the path might end inside the mountains.
// For numPlayers > 2 use the playerPosition to not end up inside the mountains.
createArea(
new PathPlacer(
numPlayers > 2 ? playerPosition[i] : passes[3 * i + 1],
numPlayers > 2 ? playerPosition[(i + 1) % numPlayers] : passes[3 * i + 2],
numPlayers == 2 ? passes[3 * i + 1] : playerPosition[i],
numPlayers == 2 ? passes[3 * i + 2] : playerPosition[(i + 1) % numPlayers],
scaleByMapSize(14, 24),
0.4,
3 * scaleByMapSize(1, 3),