epic/OpenRA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Relax TilingPath constraints on segments that don't make immediate progress

Browse Source 
The TilingPath algorithm previously rejected placing segments that do
not make immediate progress, unless they faced towards positive
progress.

However, there are cases in some mods where zero-progress segments
that end facing towards neutral progress are needed to arrive at a
tiling solution. This change allows these neutral progressions, so
long as they aren't for single-point segments.
This commit is contained in:
Ashley Newson
2025-11-08 16:59:35 +00:00
committed by Gustas Kažukauskas
parent fd5e05ca6b
commit 2359dce21b
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
OpenRA.Mods.Common/MapGenerator/TilingPath.cs
View File

@@ -358,7 +358,9 @@ namespace OpenRA.Mods.Common.MapGenerator
// order for a transition to be allowed at all, it must satisfy some constraints: // order for a transition to be allowed at all, it must satisfy some constraints:
// //
// - It must not regress backward along the path (but no immediate progress is OK). // - It must not regress backward along the path (but no immediate progress is OK).
// - If it makes exactly zero progress, it must end facing towards increasing progress. // - If it makes exactly zero progress, it must not end facing towards overall
// decreasing progress or strictly neutral progress (neither earliest or latest
// closest points differ).
// - It must not deviate at any point in the segment beyond MaxDeviation from the path. // - It must not deviate at any point in the segment beyond MaxDeviation from the path.
// - It must not skip to much later path points (which may be within MaxDeviation). // - It must not skip to much later path points (which may be within MaxDeviation).
// //
@@ -738,7 +740,7 @@ namespace OpenRA.Mods.Common.MapGenerator
lowProgressionAcc = Progress(lowProgress[point.X, point.Y], lowProgress[pointNext.X, pointNext.Y]); lowProgressionAcc = Progress(lowProgress[point.X, point.Y], lowProgress[pointNext.X, pointNext.Y]);
highProgressionAcc = Progress(highProgress[point.X, point.Y], highProgress[pointNext.X, pointNext.Y]); highProgressionAcc = Progress(highProgress[point.X, point.Y], highProgress[pointNext.X, pointNext.Y]);
if (lowProgressionAcc < 0 || highProgressionAcc < 0 || (lowProgressionAcc == 0 && highProgressionAcc == 0)) if ((lowProgressionAcc <= 0 && highProgressionAcc <= 0) || lowProgressionAcc + highProgressionAcc < 0)
return MaxCost; return MaxCost;
} }