Package de.bsommerfeld.pathetic.api.pathing.heuristic
package de.bsommerfeld.pathetic.api.pathing.heuristic
Heuristic estimation for the A* search.
IHeuristicStrategy computes the H-cost
of a node from a HeuristicContext and the
base transition cost between two positions. HeuristicStrategies exposes the bundled
implementations: LINEAR (sqrt-based, near-optimal in practice) and SQUARED
(faster, but its overestimation grows with distance, so paths can be suboptimal at range).
HeuristicWeights weights the composite's
components (Manhattan, octile, perpendicular deviation, height difference).
-
ClassDescriptionAn immutable context object used for heuristic calculations providing the essentials.A util class to provide the two predefined
IHeuristicStrategys of Pathetic.Represents a set of weights used to calculate a heuristic for the A* pathfinding algorithm.Defines the contract for heuristic strategies used in pathfinding algorithms.A linear heuristic strategy combining multiple distance metrics for pathfinding.A performance-optimized heuristic strategy using squared distance metrics.