A* (or "A-Star") pathfinding tailored to find the shortest paths on 2D grids. Compared to [AStar2D] you don't need to manually create points or connect them together. It also supports multiple type of heuristics and modes for diagonal movement. This class also provides a jumping mode which is faster to calculate than without it in the [AStar2D] class. In contrast to [AStar2D], you only need set the [member size] of the grid, optionally set the [member cell_size] and then call the [method update] method: [codeblocks] [gdscript] var astar_grid = AStarGrid2D.new() astar_grid.size = Vector2i(32, 32) astar_grid.cell_size = Vector2(16, 16) astar_grid.update() print(astar_grid.get_id_path(Vector2i(0, 0), Vector2i(3, 4))) # prints (0, 0), (1, 1), (2, 2), (3, 3), (3, 4) print(astar_grid.get_point_path(Vector2i(0, 0), Vector2i(3, 4))) # prints (0, 0), (16, 16), (32, 32), (48, 48), (48, 64) [/gdscript] [csharp] AStarGrid2D astarGrid = new AStarGrid2D(); astarGrid.Size = new Vector2i(32, 32); astarGrid.CellSize = new Vector2i(16, 16); astarGrid.Update(); GD.Print(astarGrid.GetIdPath(Vector2i.Zero, new Vector2i(3, 4))); // prints (0, 0), (1, 1), (2, 2), (3, 3), (3, 4) GD.Print(astarGrid.GetPointPath(Vector2i.Zero, new Vector2i(3, 4))); // prints (0, 0), (16, 16), (32, 32), (48, 48), (48, 64) [/csharp] [/codeblocks] Called when computing the cost between two connected points. Note that this function is hidden in the default [code]AStarGrid2D[/code] class. Called when estimating the cost between a point and the path's ending point. Note that this function is hidden in the default [code]AStarGrid2D[/code] class. Clears the grid and sets the [member size] to [constant Vector2i.ZERO]. Returns an array with the IDs of the points that form the path found by AStar2D between the given points. The array is ordered from the starting point to the ending point of the path. Returns an array with the points that are in the path found by AStarGrid2D between the given points. The array is ordered from the starting point to the ending point of the path. [b]Note:[/b] This method is not thread-safe. If called from a [Thread], it will return an empty [PackedVector3Array] and will print an error message. Indicates that the grid parameters were changed and [method update] needs to be called. Returns [code]true[/code] if the [param x] and [param y] is a valid grid coordinate (id). Returns [code]true[/code] if the [param id] vector is a valid grid coordinate. Returns [code]true[/code] if a point is disabled for pathfinding. By default, all points are enabled. Disables or enables the specified point for pathfinding. Useful for making an obstacle. By default, all points are enabled. Updates the internal state of the grid according to the parameters to prepare it to search the path. Needs to be called if parameters like [member size], [member cell_size] or [member offset] are changed. [method is_dirty] will return [code]true[/code] if this is the case and this needs to be called. The size of the point cell which will be applied to calculate the resulting point position returned by [method get_point_path]. If changed, [method update] needs to be called before finding the next path. The default [enum Heuristic] which will be used to calculate the path if [method _compute_cost] and/or [method _estimate_cost] were not overridden. A specific [enum DiagonalMode] mode which will force the path to avoid or accept the specified diagonals. Enables or disables jumping to skip up the intermediate points and speeds up the searching algorithm. The offset of the grid which will be applied to calculate the resulting point position returned by [method get_point_path]. If changed, [method update] needs to be called before finding the next path. The size of the grid (number of cells of size [member cell_size] on each axis). If changed, [method update] needs to be called before finding the next path. The Euclidean heuristic to be used for the pathfinding using the following formula: [codeblock] dx = abs(to_id.x - from_id.x) dy = abs(to_id.y - from_id.y) result = sqrt(dx * dx + dy * dy) [/codeblock] The Manhattan heuristic to be used for the pathfinding using the following formula: [codeblock] dx = abs(to_id.x - from_id.x) dy = abs(to_id.y - from_id.y) result = dx + dy [/codeblock] The Octile heuristic to be used for the pathfinding using the following formula: [codeblock] dx = abs(to_id.x - from_id.x) dy = abs(to_id.y - from_id.y) f = sqrt(2) - 1 result = (dx < dy) ? f * dx + dy : f * dy + dx; [/codeblock] The Chebyshev heuristic to be used for the pathfinding using the following formula: [codeblock] dx = abs(to_id.x - from_id.x) dy = abs(to_id.y - from_id.y) result = max(dx, dy) [/codeblock] Represents the size of the [enum Heuristic] enum. The pathfinding algorithm will ignore solid neighbors around the target cell and allow passing using diagonals. The pathfinding algorithm will ignore all diagonals and the way will be always orthogonal. The pathfinding algorithm will avoid using diagonals if at least two obstacles have been placed around the neighboring cells of the specific path segment. The pathfinding algorithm will avoid using diagonals if any obstacle has been placed around the neighboring cells of the specific path segment. Represents the size of the [enum DiagonalMode] enum.