-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tile.java
201 lines (190 loc) · 6.32 KB
/
Tile.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
import bc.*;
import java.util.HashMap;
import java.util.HashSet;
import java.util.TreeMap;
import java.util.TreeSet;
/*
data structure for caching all kinds of map data and doing nav
*/
public class Tile{
int x;
int y;
boolean isWalkable;
long karbonite;
Region region;
MapLocation myLoc;
InfoManager infoMan;
KarboniteArea karbArea;
int roundLastUpdated;
TreeSet<TargetUnit> enemiesWhichCouldHitUs;
int possibleDamage;
HashMap<Integer, Signpost> destToDir;
int distFromNearestHostile;
int distFromNearestTarget;
boolean nearLaunch;
//for combat
TreeSet<TargetUnit> enemiesWithinRangerRange;
TreeSet<TargetUnit> enemiesWithinKnightRange;
TreeSet<TargetUnit> enemiesWithinMageRange;
//boolean claimed;
boolean enemiesUpdated;
int unitID;
UnitType myType;
//boolean accessible; //contains no unit or our unit that is move ready
public Tile(boolean walkable, long karb, Region reg, MapLocation ml, InfoManager im, KarboniteArea kA){
x = ml.getX();
y = ml.getY();
isWalkable = walkable;
karbonite = karb;
region = reg;
myLoc = ml;
infoMan = im;
karbArea = kA;
roundLastUpdated = 0;
possibleDamage = 0;
destToDir = new HashMap<Integer, Signpost>();
enemiesWhichCouldHitUs = new TreeSet<TargetUnit>(new descendingPriorityComp());
enemiesWithinRangerRange = new TreeSet<TargetUnit>(new descendingPriorityComp());
enemiesWithinKnightRange = new TreeSet<TargetUnit>(new descendingPriorityComp());
enemiesWithinMageRange = new TreeSet<TargetUnit>(new descendingPriorityComp());
//accessible = false;
//claimed = false;
enemiesUpdated = false;
unitID = -1;
distFromNearestHostile = 100;
distFromNearestTarget = 100;
nearLaunch = false;
}
public void updateKarbonite(long newKarb){
if (newKarb != karbonite){
if(region != null){
region.karbonite += newKarb - karbonite;
}
if(karbonite == 0){
if(karbArea == null){
karbArea = infoMan.getKarbArea(myLoc,region);
}
karbArea.addTile(this);
}
else{
karbArea.karbonite += newKarb - karbonite;
}
if(newKarb == 0){
karbArea.removeTile(this);
}
karbonite = newKarb;
}
}
public void removeEnemy(TargetUnit tu){
enemiesWithinRangerRange.remove(tu);
enemiesWithinKnightRange.remove(tu);
enemiesWithinMageRange.remove(tu);
enemiesWhichCouldHitUs.remove(tu);
possibleDamage -= tu.damageDealingPower;
}
public void updateTarget(TargetUnit tu){
if(enemiesWithinRangerRange.remove(tu)){
enemiesWithinRangerRange.add(tu);
}
if(enemiesWithinKnightRange.remove(tu)){
enemiesWithinKnightRange.add(tu);
}
if(enemiesWithinMageRange.remove(tu)){
enemiesWithinMageRange.add(tu);
}
if(enemiesWhichCouldHitUs.remove(tu)){
enemiesWhichCouldHitUs.add(tu);
}
}
public void updateEnemies(GameController gc){
if(enemiesUpdated)
return;
//infoMan.logTimeCheckpoint("before update");
//Utils.log("updating tile " + x + " " + y);
enemiesUpdated = true;
enemiesWithinRangerRange.clear();
enemiesWithinMageRange.clear();
enemiesWithinKnightRange.clear();
enemiesWhichCouldHitUs.clear();
possibleDamage = 0;
/* // use or remove
claimed = false;
if(!gc.hasUnitAtLocation(myLoc)){
accessible = false;
}
else if(!gc.hasUnitAtLocation(myLoc)){
accessible = true;
}
else{
Unit u = gc.senseUnitAtLocation(myLoc);
if(u.team() == gc.team() && u.movementHeat() < 10)
accessible = true;
accessible = false;
}
*/
if (nearLaunch) {
possibleDamage += 100;
}
TreeSet<TargetUnit> enemies = infoMan.getTargetUnits(myLoc, MagicNumbers.MAX_DIST_TO_CHECK, false);
distFromNearestHostile = MagicNumbers.MAX_DIST_TO_CHECK + 1;
distFromNearestTarget = MagicNumbers.MAX_DIST_TO_CHECK + 1;
boolean didSomething;
for(TargetUnit tu: enemies){
MapLocation ml = tu.myLoc;
long dist = myLoc.distanceSquaredTo(ml);
if(Utils.isTypeHostile(tu.type) && dist < distFromNearestHostile){
distFromNearestHostile = (int)dist;
}
if(dist < distFromNearestTarget){
distFromNearestTarget = (int)dist;
}
if(dist > MagicNumbers.MAX_DIST_THEY_COULD_HIT_NEXT_TURN)
continue;
didSomething = false;
//System.out.println("here");
if(MagicNumbers.RANGER_MIN_RANGE <= dist && dist <= MagicNumbers.RANGER_RANGE){
enemiesWithinRangerRange.add(tu);
didSomething = true;
}
if(dist <= MagicNumbers.KNIGHT_RANGE){
enemiesWithinKnightRange.add(tu);
didSomething = true;
}
if(dist <= MagicNumbers.MAGE_RANGE){
enemiesWithinMageRange.add(tu);
didSomething = true;
}
if(didSomething){
tu.tilesWhichHitMe.add(this);
infoMan.targetUnits.put(tu.ID, tu);
}
if(!Utils.isTypeHostile(tu.type))
continue;
//figure out if they can hit this tile next turn given that they can move once
int xDif = Math.abs(ml.getX() - x);
int yDif = Math.abs(ml.getY() - y);
int closestTheyCanGet = (xDif-1) * (xDif-1) + (yDif-1) * (yDif-1);
int farthestTheyCanGet = (xDif+1) * (xDif+1) + (yDif+1) * (yDif+1);
if(closestTheyCanGet <= tu.range
&& !(tu.type == UnitType.Ranger && farthestTheyCanGet <= MagicNumbers.RANGER_MIN_RANGE)){
enemiesWhichCouldHitUs.add(tu);
possibleDamage += tu.damageDealingPower;
}
}
//infoMan.logTimeCheckpoint("after update");
}
public TreeSet<TargetUnit> getEnemiesWithinRange(UnitType type) {
switch(type){
case Ranger: return enemiesWithinRangerRange;
case Knight: return enemiesWithinKnightRange;
case Mage: return enemiesWithinMageRange;
default: return new TreeSet<TargetUnit>();
}
}
public double dangerRating(){
if (!enemiesUpdated){
updateEnemies(infoMan.gc);
}
return possibleDamage + (100 - distFromNearestHostile);
}
}