Changed collisions for mobs

Seperated mob and player collision, now they have there own individual collision boundries
Modified A* search algorithm so mobs can go diagonal freely
Started expirimenting with javadocs

Author: redomar

src/com/redomar/game/Game.java

@@ -86,6 +86,10 @@ public class Game extends Canvas implements Runnable {
 	private GameServer socketServer;
 	private Printing print = new Printing();
 
+	/**
+	 * @author Redomar
+	 * @version Alpha 1.7
+	 */
 	public Game() {
 		setMinimumSize(new Dimension(WIDTH * SCALE, HEIGHT * SCALE));
 		setMaximumSize(new Dimension(WIDTH * SCALE, HEIGHT * SCALE));

src/com/redomar/game/entities/Dummy.java

@@ -20,12 +20,13 @@ public class Dummy extends Mob {
 	private static double speed = 0.75;
 	private List<Node> path = null;
 	private int time = 0;
+	private static int[] collisionBoders = {0, 7, 0, 7};
 
 	private Swim swim;
 
 	public Dummy(LevelHandler level, String name, int x, int y, int shirtCol,
 			int faceCol) {
-		super(level, "h", x, y, speed);
+		super(level, "h", x, y, speed, collisionBoders);
 		this.faceCol = faceCol;
 		this.shirtCol = shirtCol;
 		this.colour = Colours.get(-1, 111, shirtCol, faceCol);

src/com/redomar/game/entities/Mob.java

@@ -22,13 +22,21 @@ public abstract class Mob extends Entity {
 	protected boolean isMuddy = false;
 	protected boolean changeLevels = false;
 	protected int ticker;
-
-	public Mob(LevelHandler level, String name, int x, int y, double speed) {
+	/**
+	 * [0] Contains the <strong>xMin</strong><br>
+	 * [1] Contains the <strong>xMax</strong><br>
+	 * [2] Contains the <strong>yMin</strong><br>
+	 * [3] Contains the <strong>yMax
+	 */
+	protected int[] collisionBoders = new int[4];
+
+	public Mob(LevelHandler level, String name, int x, int y, double speed, int[] collisionBoders) {
 		super(level);
 		this.name = name;
 		this.setX(x);
 		this.setY(y);
 		this.speed = speed;
+		this.collisionBoders = collisionBoders;
 	}
 
 	public void move(double xa, double ya) {
@@ -90,10 +98,10 @@ public void move(double xa, double ya) {
 	}
 
 	public boolean hasCollided(double xa, double ya){
-		int xMin = -2;
-		int xMax = 8;
-		int yMin = 0;
-		int yMax = 7;
+		int xMin = collisionBoders[0];
+		int xMax = collisionBoders[1];
+		int yMin = collisionBoders[2];
+		int yMax = collisionBoders[3];
 
 		for (int x = xMin; x < xMax; x++) {
 			if (isSolid((int) xa, (int) ya, x, yMin)) {

src/com/redomar/game/entities/Player.java

@@ -24,12 +24,13 @@ public class Player extends Mob {
 	private String userName;
 	private boolean[] swimType;
 	private int[] swimColour;
+	private static int[] collisionBoders = {-2, 8, 0, 7};
 
 	public static String guestPlayerName = customeName.setName("Player ");
 
 	public Player(LevelHandler level, int x, int y, InputHandler input,
 			String userName,  int shirtCol,	int faceCol) {
-		super(level, "Player", x, y, speed);
+		super(level, "Player", x, y, speed, collisionBoders);
 		this.input = input;
 		this.userName = userName;
 		this.faceCol = faceCol;

src/com/redomar/game/level/LevelHandler.java

@@ -237,7 +237,7 @@ public List<Node> findPath(Vector2i start, Vector2i goal){
 				if(at == null) continue;
 				if(at.isSolid()) continue;
 				Vector2i a = new Vector2i(x + xi, y + yi);
-				double gCost = current.gCost + getDistance(current.tile, a);
+				double gCost = current.gCost + (getDistance(current.tile, a) == 1 ? 1 : 0.95);
 				double hCost = getDistance(a, goal);
 				Node node = new Node(a, current, gCost, hCost);
 				if(isVectorInList(closedList, a) && gCost >= node.gCost) continue;