tile-node-network

Tile Node Network (A* Pathfinding)

Key Types

• FlatRedBall2.AI.TileNodeNetwork — the grid; builds and queries the A* graph
• FlatRedBall2.AI.TileNode — one cell; has Position, Tag, Neighbors
• FlatRedBall2.AI.DirectionalType — Four (cardinal only) or Eight (+ diagonals)

Standard Setup

The standard FlatRedBall2 tile size is 16 units. Node origins are offset by half a tile from the TileShapes corner, so node centers fall at 8, 24, 40, … (i.e. tileCollection.X + 8, tileCollection.Y + 8).

var network = new TileNodeNetwork(
    xOrigin:         tilesOriginX + 8f,   // center of first column
    yOrigin:         tilesOriginY + 8f,   // center of bottom row
    gridSpacing:     16f,
    xCount:          gridCols,
    yCount:          gridRows,
    directionalType: DirectionalType.Eight);

network.FillCompletely();

// Remove nodes where walls are (call after all wall tiles are placed)
foreach (var (col, row) in wallCells)
    network.RemoveAt(col, row);

// For 8-way: prevent squeezing diagonally through wall corners
network.EliminateCutCorners();

Getting a Path

// Allocating — returns a new List<Vector2>
List<Vector2> path = network.GetPath(startNode, endNode);

// Non-allocating — clears and fills an existing list; returns true if path found
bool found = network.GetPath(startNode, endNode, _path);

The start node is excluded; the end node is the last entry. Returns empty / false if no path exists.

Finding Nodes

TileNode? node = network.NodeAt(col, row);                  // by grid index, null if empty
TileNode? node = network.NodeAtWorld(worldX, worldY);       // by world position, null if empty
TileNode? node = network.GetClosestNode(worldX, worldY);    // nearest occupied node

Use GetClosestNode to find the start/end nodes from entity world positions.

TileNode.Tag

Attach game data to nodes (terrain type, waypoint markers, etc.):

node.Tag = MyTerrainType.Mud;