Class EuclideanEmbedding

Public

Implements heuristic optimizations.

See

heuristic-opt

Game AI Pro - Pathfinding Architecture Optimizations by Steve Rabin and Nathan R. Sturtevant

A* Pro Feature

This is an A* Pathfinding Project Pro feature only. This function/class/variable might not exist in the Free version of the A* Pathfinding Project or the functionality might be limited.
The Pro version can be bought here

Inner Types

EuclideanEmbeddingSearchPath

Public Methods

Public Static Methods

GetHeuristic (costs, pivotCount, nodeIndex1, nodeIndex2)

Public Variables

costs

Costs laid out as n*[int],n*[int],n*[int] where n is the number of pivot points.

Public
dirty
Public
mode

If heuristic optimization should be used and how to place the pivot points.

Public
pivotCount
Public
pivotPointRoot

All children of this transform will be used as pivot points.

Public
seed
Public
spreadOutCount
Public

Private/Protected Members

ApplyGridGraphEndpointSpecialCase ()

Special case necessary for paths to unwalkable nodes right next to walkable nodes to be able to use good heuristics.

GetRandom ()

Simple linear congruential generator.

PickNRandomNodes (count, buffer)

Pick N random walkable nodes from all nodes in all graphs and add them to the buffer.

pivots
Private
ra
Private Static
rc
Private Static
rval
Private