Files
OpenFrontIO/tests/core/pathfinding/PathFinding.Air.test.ts
Arkadiusz Sygulski 0e3ced3bfa Pathfinding Refactor pt. 2 (#2866)
## Playtest

https://pf-pt-2.openfront.dev/

## Pathfinding Refactor pt. 2

<img width="1536" height="1024" alt="image"
src="https://github.com/user-attachments/assets/9477958e-54b7-4c83-b317-ba789e809e9e"
/>


This is a follow-up to a previous PR introducing pathfinding changes.
This time, it introduces a complete refactor of `pathfinding` directory
and breakdown into composable pieces.

### Unified PathFinder interface

`PathFinder<T>` and `SteppingPathFinder<T>` are introduced to unify
**all** pathfinding across the application. First one exposes complete
path, while stepping variant allows the callee to iterate over the path
by calling `.next`. All pathfinders share this one common interface,
which makes them easy to use in any scenario -
`PathFinding.Water(game).search(from, to)`.

`SteppingPathFinder<T>` extends `PathFinder<T>` with an ability to
iterate over the path. It handles caching, storing current index and
invalidation. This allows the units to not care about the inner workings
of the pathfinder and just call `pf.next(current, target)` and receive
instructions on what to do next.

### Common entry point

All pathfinders are now exposed from common `PathFinding` entrypoint:

- `PathFinding.Water`
- `PathFinding.Rail`
- `PathFinding.Stations`
- `PathFinding.Rail`

Additional entry point is introduced for pathfinders which need to work
both in the worker, but also on the frontend, which lacks `Game`
interface. Currently only `UniversalPathFinding.Parabola` is available.

### Spatial Query

New module has been introduced close to `pathfinding` - `SpatialQuery`.
It aims to resolve any questions game may have about finding tiles
meeting criteria. Currently `SpatialQuery.closestShore(player, target)`
and `SpatialQuery.closestShoreByWater(player, target)` are available -
they help answering questions about naval invasion: "What is the best
landing location from user's click?" and "Which our tile should be used
to launch the transport ship?". Under the hood they use very similar
mechanics to pathfinding, so it felt right to put them close by.

### Modular architecture

Pathfinders now support transformers: `MiniMapTransformer`,
`ShoreCoercingTransformer`, `ComponentCheckTransformer`,
`SmoothingTransformer`. Transformers functions like a middleware in the
pathfinding chain. They wrap around the pathfinder and provide
additional functionality. This allows the pathfinder to focus on
actually finding the path instead of doing unrelated things.

Example chain for simple (A*) water pathfinding:
```ts
static WaterSimple(game: Game): SteppingPathFinder<TileRef> {
  const miniMap = game.miniMap();
  const pf = new AStarWater(miniMap);

  return PathFinderBuilder.create(pf)
    .wrap((pf) => new ShoreCoercingTransformer(pf, miniMap))
    .wrap((pf) => new MiniMapTransformer(pf, game.map(), miniMap))
    .buildWithStepper(tileStepperConfig(game));
}
```

The Pathfinder - here `AStarWater` - does not care about the conversion
between minimap and main map tiles. It also does not care if the source
or destination is a land tile. The transformers take care of that. The
pathfinder gets a set of valid coordinates and produces the path -
that's it.

Modular approach makes working on a particular set of utilities much
easier - for example map upscaling is handled consistently across all
pathfinders. Additionally, the pathfinders are not tied to the
particular map resolution used. Pass them a different map and they will
work the same.

### Algorithms

Algorithms used are neatly organized inside
`src/core/pathfinding/algorithms`. They are prefixed with the algorithm
name and suffixed with the use case. File without suffix exposes generic
version ready to traverse any graph with adapters. Specialized versions
either use an adapter or inline logic when performance is critical -
using adapters leads to 20-30% performance loss.

The directory includes `A*` and `BFS` but also other useful utils, such
as `AbstractGraph` used to generate... an abstract graph on top of the
tile map and `ConnectedComponents` helping to identify whether two tiles
are connected by a path without actually computing the path.

### Playground

The playground have been updated with new algorithms, including tweaked
very greedy `A*`.

<img width="2175" height="1424" alt="image"
src="https://github.com/user-attachments/assets/1f833651-0024-4299-bf86-882f5368358c"
/>

### Tests

Yeah, there are some, a little too many if I say so myself. But there
are no useless tests. I had to ensure refactored code works somehow
reliably. This PR comes with trust me bro guarantee, but I would
appreciate someone confirming **naval invasions, nukes (esp. MIRV) and
warships**.

### Discord
`moleole`

GL & HF
2026-01-11 20:11:14 -08:00

185 lines
5.2 KiB
TypeScript

import { beforeAll, describe, expect, it } from "vitest";
import { Game } from "../../../src/core/game/Game";
import { TileRef } from "../../../src/core/game/GameMap";
import { PathFinding } from "../../../src/core/pathfinding/PathFinder";
import { SteppingPathFinder } from "../../../src/core/pathfinding/types";
import { setup } from "../../util/Setup";
describe("PathFinding.Air", () => {
let game: Game;
function createPathFinder(): SteppingPathFinder<TileRef> {
return PathFinding.Air(game);
}
beforeAll(async () => {
game = await setup("ocean_and_land");
});
describe("findPath", () => {
it("returns path between any two points (ignores terrain)", () => {
const pathFinder = createPathFinder();
const map = game.map();
// Air pathfinder ignores terrain, so can go anywhere
// (2,2) → (14,14): manhattan = 24, path length = 25
const from = map.ref(2, 2);
const to = map.ref(14, 14);
const path = pathFinder.findPath(from, to);
expect(path).not.toBeNull();
expect(path!.length).toBe(25);
expect(path![0]).toBe(from);
expect(path![path!.length - 1]).toBe(to);
});
it("throws error for multiple start points", () => {
const pathFinder = createPathFinder();
const map = game.map();
const from = [map.ref(2, 2), map.ref(4, 4)];
const to = map.ref(14, 14);
expect(() => pathFinder.findPath(from, to)).toThrow(
"does not support multiple start points",
);
});
it("returns single-tile path when from equals to", () => {
const pathFinder = createPathFinder();
const map = game.map();
const tile = map.ref(8, 8);
const path = pathFinder.findPath(tile, tile);
expect(path).not.toBeNull();
expect(path![0]).toBe(tile);
});
});
describe("path validity", () => {
it("all consecutive tiles in path are adjacent (Manhattan distance 1)", () => {
const pathFinder = createPathFinder();
const map = game.map();
// (2,2) → (14,14): manhattan = 24, path length = 25
const from = map.ref(2, 2);
const to = map.ref(14, 14);
const path = pathFinder.findPath(from, to);
expect(path).not.toBeNull();
expect(path!.length).toBe(25);
// Verify every consecutive pair is adjacent
for (let i = 1; i < path!.length; i++) {
const dist = map.manhattanDist(path![i - 1], path![i]);
expect(dist).toBe(1);
}
});
it("path ends at exact destination", () => {
const pathFinder = createPathFinder();
const map = game.map();
const from = map.ref(5, 5);
const to = map.ref(10, 12);
const path = pathFinder.findPath(from, to);
expect(path).not.toBeNull();
expect(path![path!.length - 1]).toBe(to);
});
});
describe("path shapes", () => {
it("diagonal path has equal X and Y movement", () => {
const pathFinder = createPathFinder();
const map = game.map();
// Equal X and Y offset: (0,0) → (10,10)
const from = map.ref(0, 0);
const to = map.ref(10, 10);
const path = pathFinder.findPath(from, to);
expect(path).not.toBeNull();
let xMoves = 0;
let yMoves = 0;
for (let i = 1; i < path!.length; i++) {
const dx = map.x(path![i]) - map.x(path![i - 1]);
const dy = map.y(path![i]) - map.y(path![i - 1]);
if (dx !== 0) xMoves++;
if (dy !== 0) yMoves++;
}
expect(xMoves).toBe(10);
expect(yMoves).toBe(10);
});
it("horizontal path has only X movement", () => {
const pathFinder = createPathFinder();
const map = game.map();
// Pure horizontal: (0,5) → (15,5)
const from = map.ref(0, 5);
const to = map.ref(15, 5);
const path = pathFinder.findPath(from, to);
expect(path).not.toBeNull();
let xMoves = 0;
let yMoves = 0;
for (let i = 1; i < path!.length; i++) {
const dx = map.x(path![i]) - map.x(path![i - 1]);
const dy = map.y(path![i]) - map.y(path![i - 1]);
if (dx !== 0) xMoves++;
if (dy !== 0) yMoves++;
}
expect(xMoves).toBe(15);
expect(yMoves).toBe(0);
});
it("vertical path has only Y movement", () => {
const pathFinder = createPathFinder();
const map = game.map();
// Pure vertical: (5,0) → (5,15)
const from = map.ref(5, 0);
const to = map.ref(5, 15);
const path = pathFinder.findPath(from, to);
expect(path).not.toBeNull();
let xMoves = 0;
let yMoves = 0;
for (let i = 1; i < path!.length; i++) {
const dx = map.x(path![i]) - map.x(path![i - 1]);
const dy = map.y(path![i]) - map.y(path![i - 1]);
if (dx !== 0) xMoves++;
if (dy !== 0) yMoves++;
}
expect(xMoves).toBe(0);
expect(yMoves).toBe(15);
});
it("adjacent tiles produce minimal path", () => {
const pathFinder = createPathFinder();
const map = game.map();
const from = map.ref(5, 5);
const to = map.ref(6, 5);
const path = pathFinder.findPath(from, to);
expect(path).not.toBeNull();
expect(path!.length).toBe(2);
expect(path![0]).toBe(from);
expect(path![1]).toBe(to);
});
});
});