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.findCoveredAttackPath(int moveLength,
int preferredRange,
double coverPreference,
FOV fov,
boolean seekDistantGoals,
Set<Coord> impassable,
Set<Coord> onlyPassable,
List<Threat> threats,
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 while staying in areas that none of the
given threats are able to see (which should prevent them from attacking), until a cell is reached with
a distance from a goal that is at equal to preferredRange,
which may go further from a goal if the preferredRange has not been met at the current distance.
|
ArrayList<Coord> |
DijkstraMap.findCoveredAttackPath(int moveLength,
int preferredRange,
double coverPreference,
FOVCache fov,
boolean seekDistantGoals,
Set<Coord> impassable,
Set<Coord> onlyPassable,
List<Threat> threats,
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 while staying in areas that none of the
given threats are able to see (which should prevent them from attacking), until a cell is reached with
a distance from a goal that is at equal to preferredRange,
which may go further from a goal if the preferredRange has not been met at the current distance.
|
ArrayList<Coord> |
DijkstraMap.findCoveredAttackPath(int moveLength,
int minPreferredRange,
int maxPreferredRange,
double coverPreference,
FOV fov,
boolean seekDistantGoals,
Set<Coord> impassable,
Set<Coord> onlyPassable,
List<Threat> threats,
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 while staying in areas that none of the
given threats are able to see (which should prevent them from attacking), 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.findCoveredAttackPath(int moveLength,
int minPreferredRange,
int maxPreferredRange,
double coverPreference,
FOVCache fov,
boolean seekDistantGoals,
Set<Coord> impassable,
Set<Coord> onlyPassable,
List<Threat> threats,
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 while staying in areas that none of the
given threats are able to see (which should prevent them from attacking), 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.findCoveredAttackPath(int moveLength,
int minPreferredRange,
int maxPreferredRange,
double coverPreference,
Set<Coord> impassable,
Set<Coord> onlyPassable,
List<Threat> threats,
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 while staying in areas that none of the
given threats are able to see (which should prevent them from attacking), 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.
|
Copyright © 2012–2016. All rights reserved.