Package | Description |
---|---|
squidpony.squidai |
Tools for finding paths, optimizing targets for area-of-effect (AOE) abilities, and evaluating influence on a grid.
|
Modifier and Type | Method and Description |
---|---|
ArrayList<Coord> |
DijkstraMap.findAttackPath(int moveLength,
int minPreferredRange,
int maxPreferredRange,
LOS los,
Set<Coord> impassable,
Set<Coord> onlyPassable,
Coord start,
Coord... targets)
Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list
of Coord positions (using the current measurement) needed to get closer to a goal, until a cell is reached with
a distance from a goal that is at least equal to minPreferredRange and no more than maxPreferredRange,
which may go further from a goal if the minPreferredRange has not been met at the current distance.
|
ArrayList<Coord> |
DijkstraMap.findAttackPath(int moveLength,
int preferredRange,
LOS los,
Set<Coord> impassable,
Set<Coord> onlyPassable,
Coord start,
Coord... targets)
Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list
of Coord positions (using the current measurement) needed to get closer to a goal, until preferredRange is
reached, or further from a goal if the preferredRange has not been met at the current distance.
|
ArrayList<Coord> |
DijkstraMap.findAttackPathLarge(int size,
int moveLength,
int minPreferredRange,
int maxPreferredRange,
LOS los,
Set<Coord> impassable,
Set<Coord> onlyPassable,
Coord start,
Coord... targets)
Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list
of Coord positions (using the current measurement) needed to get closer to a goal, until a cell is reached with
a distance from a goal that is at least equal to minPreferredRange and no more than maxPreferredRange,
which may go further from a goal if the minPreferredRange has not been met at the current distance.
|
ArrayList<Coord> |
DijkstraMap.findAttackPathLarge(int size,
int moveLength,
int preferredRange,
LOS los,
Set<Coord> impassable,
Set<Coord> onlyPassable,
Coord start,
Coord... targets)
Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list
of Coord positions (using the current measurement) needed to get closer to a goal, until preferredRange is
reached, or further from a goal if the preferredRange has not been met at the current distance.
|
ArrayList<Coord> |
DijkstraMap.findTechniquePath(int moveLength,
Technique tech,
char[][] dungeon,
LOS los,
Set<Coord> impassable,
Set<Coord> allies,
Coord start,
Set<Coord> targets)
Scans the dungeon using DijkstraMap.scan with the listed goals and start point, and returns a list
of Coord positions (using the current measurement) needed to get closer to a goal, where goals are
considered valid if they are at a valid range for the given Technique to hit at least one target
and ideal if that Technique can affect as many targets as possible from a cell that can be moved
to with at most movelength steps.
|
Copyright © 2012–2016. All rights reserved.