a* fastest route w/heavy lifting
This block is part of the a* path finding group and was last modified in core v12.0.7.
a* fastest route w/heavy lifting v12.0.7 Calculates the fastest route over multiple stops using heavy lifting parameters.
- flow
flow - stops required
arrayArray [Array [x (Number), y (Number)]] or array with objects using
stops_key. - end at required
arrayArray [x (Number), y (Number)]
- Key
valueThe key to read from the stops array, in case the array contains objects. It contains the tiles to walk.
- Percentage key
valueThe percentage key to read from the stops array, in case the array contains objects. It may contain a percentage of heavy lifting required.
- Required percentage
numberThe minimum percentage heavy lifting required before splitting up routes. This allows for optimalization.
- Lifting percentage
numberThe maximum percentage heavy lifting allowed, until the user has to end the route before they can continue.
- grid width required
numberWidth of 2D matrix
- grid height required
numberHeight of 2D matrix
- tiles required
arrayCould be an array of 2D matrix or x, y, state. We support the following states:
heavy,heavy_x2andheavy_x4. - allow diagonal
conditionDefault: false
- cross corners
conditionDefault: false
- flow
flow - path Matrix
arrayPath matrix
[x_y, ..] - path Readable
arrayHuman readable path.
- cost
numberCalculated cost to walk this path to the end.
- return cost
numberCalculated cost to return from last point back to first.
- return index
numberIf percentage given, we return from this index.
A typical wiring for a* fastest route w/heavy lifting: a function trigger starts the flow; with values feeds the stops pin; with values feeds the end pin; number feeds the width pin; number feeds the height pin; with values feeds the tiles pin; the flow out pin feeds debug.

Version history
Introduced in v12.0.7.
v10.1.2, click here to see the release notes. Back to
a* path finding Return to the main group to view all sub-groups Back to pathfinding Return to the group to view all blocks within this group
