FIXED ASTAR NOW WORKING!!!!!!!
This commit is contained in:
parent
acde8264af
commit
5e17bdd5e5
10 changed files with 592 additions and 19 deletions
86
src/ei/game/algo/AStar.java
Normal file
86
src/ei/game/algo/AStar.java
Normal file
|
|
@ -0,0 +1,86 @@
|
|||
package ei.game.algo;
|
||||
|
||||
import java.util.LinkedList;
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
import ei.engine.math.Vector2i;
|
||||
import ei.game.algo.AStarNode2D.Heuristic;
|
||||
import ei.game.gamestate.InGameState;
|
||||
|
||||
public class AStar{
|
||||
private static final long serialVersionUID = 1L;
|
||||
private AStarPathfinder pathfinder;
|
||||
|
||||
private int width;
|
||||
private int hight;
|
||||
private AStarNode[][] map;
|
||||
|
||||
protected boolean randomizeMap = true;
|
||||
protected Random RAND = new Random(0);
|
||||
|
||||
public AStar() {
|
||||
width = InGameState.getMap().getSize().getX();
|
||||
hight = InGameState.getMap().getSize().getY();
|
||||
initializePathfinder();
|
||||
initializeMap();
|
||||
}
|
||||
|
||||
public List<AStarNode> startSearch(Vector2i start, Vector2i goal){
|
||||
return pathfinder.findPath(map[start.getX()][start.getY()], map[goal.getX()][goal.getY()]);
|
||||
}
|
||||
|
||||
protected void initializePathfinder() {
|
||||
System.out.println("Initializing pathfinder");
|
||||
|
||||
AStarNode2D.heuristic = Heuristic.Euclidean;
|
||||
|
||||
// Create the pathfinder.
|
||||
pathfinder = new AStarPathfinder();
|
||||
}
|
||||
|
||||
|
||||
protected void initializeMap() {
|
||||
System.out.println("Initializing map");
|
||||
// Create the map.
|
||||
map = new AStarNode2D[width][hight];
|
||||
for(int x = 0, nodeId = 0; width > x; x++) {
|
||||
for(int y = 0; hight > y; y++, nodeId++) {
|
||||
map[x][y] = new AStarNode2D(x, y, nodeId);
|
||||
|
||||
if(!InGameState.getMap().isPosEmpty(x, y)) {
|
||||
map[x][y].setBlocked(true);
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
// Create the neighbours.
|
||||
for(int x = 0; width > x; x++) {
|
||||
for(int y = 0; hight > y; y++) {
|
||||
|
||||
List<AStarNeighbour> neighbours = new LinkedList<AStarNeighbour>();
|
||||
|
||||
if(y-1 >= 0)
|
||||
neighbours.add(new AStarNeighbour(map[x][y-1], AStarNeighbour.Location.Adjacent)); // North.
|
||||
if(x+1 < width && y-1 > 0)
|
||||
neighbours.add(new AStarNeighbour(map[x+1][y-1], AStarNeighbour.Location.Diagonal)); // North-East.
|
||||
if(x+1 < width)
|
||||
neighbours.add(new AStarNeighbour(map[x+1][y], AStarNeighbour.Location.Adjacent)); // East.
|
||||
if(x+1 < width && y+1 < hight)
|
||||
neighbours.add(new AStarNeighbour(map[x+1][y+1], AStarNeighbour.Location.Diagonal)); // South-East.
|
||||
if(y+1 < hight)
|
||||
neighbours.add(new AStarNeighbour(map[x][y+1], AStarNeighbour.Location.Adjacent)); // South.
|
||||
if(x-1 >= 0 && y+1 < hight)
|
||||
neighbours.add(new AStarNeighbour(map[x-1][y+1], AStarNeighbour.Location.Diagonal)); // South-West.
|
||||
if(x-1 >= 0)
|
||||
neighbours.add(new AStarNeighbour(map[x-1][y], AStarNeighbour.Location.Adjacent)); // West.
|
||||
|
||||
if(x-1 >= 0 && y-1 > 0) neighbours.add(new AStarNeighbour(map[x-1][y-1], AStarNeighbour.Location.Diagonal)); // North-West.
|
||||
|
||||
map[x][y].setNeighbours(neighbours);
|
||||
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue