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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
package ch.asynk.tankontank.engine;
import java.util.ArrayList;
import java.util.List;
import java.util.LinkedList;
import java.util.HashSet;
import java.util.LinkedHashSet;
import com.badlogic.gdx.utils.Disposable;
import com.badlogic.gdx.math.Vector2;
import com.badlogic.gdx.math.Vector3;
public class PossiblePaths implements Disposable
{
private final Board board;
public Pawn pawn;
public Tile from;
public Tile to;
public int distance;
public Orientation orientation;
private List<Tile> stack;
private List<Tile> ctrlTiles;
private List<Path> paths;
private List<Path> filteredPaths;
private HashSet<Tile> tiles;
public PossiblePaths(Board board, int tSize, int stSize, int ftSize, int vectSize)
{
this.board = board;
this.tiles = new LinkedHashSet<Tile>(tSize);
this.stack = new ArrayList<Tile>(stSize);
this.ctrlTiles = new ArrayList<Tile>(ftSize);
this.paths = new LinkedList<Path>();
this.filteredPaths = new LinkedList<Path>();
this.to = null;
this.pawn = null;
this.orientation = Orientation.KEEP;
}
public void init(Pawn pawn, Tile from)
{
this.pawn = pawn;
this.from = from;
}
public void init(Pawn pawn)
{
init(pawn, pawn.getTile());
}
public boolean isSet()
{
return (to != null);
}
@Override
public void dispose()
{
clear();
}
public void clear()
{
this.to = null;
this.distance = -1;
this.orientation = Orientation.KEEP;
for (Path path : this.paths) path.dispose();
this.tiles.clear();
this.stack.clear();
this.ctrlTiles.clear();
this.paths.clear();
this.filteredPaths.clear();
}
public int size()
{
if (ctrlTiles.size() == 0)
return paths.size();
return filteredPaths.size();
}
public boolean contains(Tile tile)
{
return tiles.contains(tile);
}
public void enable(int i, boolean enable)
{
for (Tile tile : tiles)
board.enableOverlayOn(tile, i, enable);
}
public int build(Tile to)
{
clear();
this.to = to;
// from and to are not part of the path
this.distance = board.distance(from, to);
if (distance < 2) {
Orientation o = Orientation.fromMove(to.col, to.row, from.col, from.row);
Path path = Path.get(0);
path.roadMarch = to.road(o);
path.cost = to.costFrom(pawn, o);
paths.add(path);
} else {
findAllPaths(from, pawn.getMovementPoints(), true);
}
// printToErr("paths", paths);
stack.clear();
return paths.size();
}
private void findAllPaths(Tile from, int mvtLeft, boolean roadMarch)
{
Tile moves[] = new Tile[6];
board.setAdjacentTiles(from, moves);
for(int i = 0; i < 6; i++) {
Tile next = moves[i];
if ((next == null) || next.isOffMap()) continue;
Orientation o = board.getSide(i);
int m = (mvtLeft - next.costFrom(pawn, o));
boolean r = roadMarch & next.road(o);
int l = (m + (r ? pawn.getRoadMarchBonus() : 0));
if ((board.distance(next, to) <= l)) {
if (next == to) {
Path path = Path.get(stack.size() + 1);
for (Tile t: stack) {
path.tiles.add(t);
tiles.add(t);
}
path.roadMarch = r;
path.cost = (pawn.getMovementPoints() - m);
paths.add(path);
} else {
stack.add(next);
findAllPaths(next, m, r);
stack.remove(stack.size() - 1);
}
}
}
}
public int toggleCtrlTile(Tile tile)
{
if (ctrlTiles.contains(tile))
ctrlTiles.remove(tile);
else
ctrlTiles.add(tile);
return filterPaths();
}
private int filterPaths()
{
int s = ctrlTiles.size();
tiles.clear();
filteredPaths.clear();
for (Path path : paths) {
int ok = 0;
for (Tile filter : ctrlTiles) {
if (path.tiles.contains(filter))
ok += 1;
}
if (ok == s) {
if (path.tiles.size() == (s + 0)) { // from and to are not part of the path
filteredPaths.clear();
filteredPaths.add(path);
tiles.clear();
for (Tile tile : path.tiles) tiles.add(tile);
break;
} else {
filteredPaths.add(path);
for (Tile tile : path.tiles) tiles.add(tile);
}
}
}
// printToErr("filteredPaths", filteredPaths);
return filteredPaths.size();
}
public int pathCost(int i)
{
return paths.get(i).cost;
}
public Move getMove()
{
if (size() != 1) {
System.err.println("ask for only move but they are many");
return null;
}
return Move.get(pawn, from, to, orientation, getPath(0));
}
public Move getExitMove()
{
Move move = getMove();
move.type = Move.MoveType.EXIT;
return move;
}
public Path getPath(int i)
{
if (ctrlTiles.size() == 0)
return paths.get(i);
return filteredPaths.get(i);
}
public void setExit(Orientation exit)
{
Path path = getPath(0);
path.cost += 1;
path.tiles.add(to);
to = board.getAdjTileAt(to, exit);
}
private void printToErr(String what, List<Path> paths)
{
System.err.println(what + pawn + " ("+paths.size()+") " + from + " -> " + to);
for (Path path : paths) {
System.err.println(String.format(" - path (l:%d c:%d r:%b)", path.tiles.size(), path.cost, path.roadMarch));
for(Tile tile : path.tiles)
System.err.println(" " + tile.toString());
}
System.err.println();
}
}
|
