|
0
|
1 |
#include "stdafx.h"
|
|
|
2 |
#include "ttd.h"
|
|
|
3 |
#include "player.h"
|
|
|
4 |
#include "vehicle.h"
|
|
|
5 |
#include "engine.h"
|
|
|
6 |
#include "command.h"
|
|
|
7 |
#include "town.h"
|
|
|
8 |
#include "industry.h"
|
|
|
9 |
#include "station.h"
|
|
|
10 |
#include "pathfind.h"
|
|
|
11 |
#include "economy.h"
|
|
|
12 |
#include "airport.h"
|
|
|
13 |
|
|
|
14 |
// remove some day perhaps?
|
|
|
15 |
static Player *_cur_ai_player;
|
|
|
16 |
|
|
|
17 |
typedef void AiStateAction(Player *p);
|
|
|
18 |
|
|
|
19 |
enum {
|
|
|
20 |
AIS_0 = 0,
|
|
|
21 |
AIS_1 = 1,
|
|
|
22 |
AIS_VEH_LOOP = 2,
|
|
|
23 |
AIS_VEH_CHECK_REPLACE_VEHICLE = 3,
|
|
|
24 |
AIS_VEH_DO_REPLACE_VEHICLE = 4,
|
|
|
25 |
AIS_WANT_NEW_ROUTE = 5,
|
|
|
26 |
AIS_BUILD_DEFAULT_RAIL_BLOCKS = 6,
|
|
|
27 |
AIS_BUILD_RAIL = 7,
|
|
|
28 |
AIS_BUILD_RAIL_VEH = 8,
|
|
|
29 |
AIS_DELETE_RAIL_BLOCKS = 9,
|
|
|
30 |
AIS_BUILD_DEFAULT_ROAD_BLOCKS = 10,
|
|
|
31 |
AIS_BUILD_ROAD = 11,
|
|
|
32 |
AIS_BUILD_ROAD_VEHICLES = 12,
|
|
|
33 |
AIS_DELETE_ROAD_BLOCKS = 13,
|
|
|
34 |
AIS_AIRPORT_STUFF = 14,
|
|
|
35 |
AIS_BUILD_DEFAULT_AIRPORT_BLOCKS = 15,
|
|
|
36 |
AIS_BUILD_AIRCRAFT_VEHICLES = 16,
|
|
|
37 |
AIS_CHECK_SHIP_STUFF = 17,
|
|
|
38 |
AIS_BUILD_DEFAULT_SHIP_BLOCKS = 18,
|
|
|
39 |
AIS_DO_SHIP_STUFF = 19,
|
|
|
40 |
AIS_SELL_VEHICLE = 20,
|
|
|
41 |
AIS_REMOVE_STATION = 21,
|
|
|
42 |
AIS_REMOVE_TRACK = 22,
|
|
|
43 |
AIS_REMOVE_SINGLE_RAIL_TILE = 23
|
|
|
44 |
};
|
|
|
45 |
|
|
|
46 |
|
|
|
47 |
#include "table/ai_rail.h"
|
|
|
48 |
|
|
|
49 |
static byte GetRailTrackStatus(TileIndex tile) {
|
|
|
50 |
uint32 r = GetTileTrackStatus(tile, 0);
|
|
|
51 |
return (byte) (r | r >> 8);
|
|
|
52 |
}
|
|
|
53 |
|
|
|
54 |
|
|
|
55 |
static void AiCase0(Player *p)
|
|
|
56 |
{
|
|
|
57 |
p->ai.state = AIS_REMOVE_TRACK;
|
|
|
58 |
p->ai.state_counter = 0;
|
|
|
59 |
}
|
|
|
60 |
|
|
|
61 |
static void AiCase1(Player *p)
|
|
|
62 |
{
|
|
|
63 |
p->ai.cur_veh = NULL;
|
|
|
64 |
p->ai.state = AIS_VEH_LOOP;
|
|
|
65 |
}
|
|
|
66 |
|
|
|
67 |
static void AiStateVehLoop(Player *p)
|
|
|
68 |
{
|
|
|
69 |
Vehicle *v;
|
|
|
70 |
|
|
|
71 |
v = p->ai.cur_veh == NULL ? _vehicles : p->ai.cur_veh+1;
|
|
|
72 |
|
|
|
73 |
for (;v != endof(_vehicles); v++) {
|
|
|
74 |
if (v->type == 0 || v->owner != _current_player)
|
|
|
75 |
continue;
|
|
|
76 |
|
|
|
77 |
if ((v->type == VEH_Train && v->subtype==0) ||
|
|
|
78 |
v->type == VEH_Road ||
|
|
|
79 |
(v->type == VEH_Aircraft && v->subtype <= 2) ||
|
|
|
80 |
v->type == VEH_Ship) {
|
|
|
81 |
|
|
|
82 |
/* replace engine? */
|
|
|
83 |
if (v->type == VEH_Train && v->engine_type < 3 &&
|
|
|
84 |
(_price.build_railvehicle >> 3) < p->player_money) {
|
|
|
85 |
p->ai.state = AIS_VEH_CHECK_REPLACE_VEHICLE;
|
|
|
86 |
p->ai.cur_veh = v;
|
|
|
87 |
return;
|
|
|
88 |
}
|
|
|
89 |
|
|
|
90 |
/* not profitable? */
|
|
|
91 |
if (v->age >= 730 &&
|
|
|
92 |
v->profit_last_year < _price.station_value*5 &&
|
|
|
93 |
v->profit_this_year < _price.station_value*5) {
|
|
|
94 |
p->ai.state_counter = 0;
|
|
|
95 |
p->ai.state = AIS_SELL_VEHICLE;
|
|
|
96 |
p->ai.cur_veh = v;
|
|
|
97 |
return;
|
|
|
98 |
}
|
|
|
99 |
|
|
|
100 |
/* not reliable? */
|
|
|
101 |
if ((v->age != 0 &&
|
|
|
102 |
_engines[v->engine_type].reliability < 35389) ||
|
|
|
103 |
v->age >= v->max_age) {
|
|
|
104 |
p->ai.state = AIS_VEH_CHECK_REPLACE_VEHICLE;
|
|
|
105 |
p->ai.cur_veh = v;
|
|
|
106 |
return;
|
|
|
107 |
}
|
|
|
108 |
}
|
|
|
109 |
}
|
|
|
110 |
|
|
|
111 |
p->ai.state = AIS_WANT_NEW_ROUTE;
|
|
|
112 |
p->ai.state_counter = 0;
|
|
|
113 |
}
|
|
|
114 |
|
|
|
115 |
// XXX
|
|
|
116 |
static const byte _rail_locos_count[3] = {
|
|
|
117 |
27, 3, 5
|
|
|
118 |
};
|
|
|
119 |
extern const byte _rail_engines_start[3];
|
|
|
120 |
|
|
|
121 |
static int AiChooseTrainToBuild(byte railtype, int32 money, byte flag)
|
|
|
122 |
{
|
|
|
123 |
int best_veh_index = -1;
|
|
|
124 |
byte best_veh_score = 0;
|
|
|
125 |
int32 r;
|
|
|
126 |
|
|
|
127 |
int i = _rail_engines_start[railtype];
|
|
|
128 |
int end = i + _rail_locos_count[railtype];
|
|
|
129 |
Engine *e = &_engines[i];
|
|
|
130 |
do {
|
|
|
131 |
assert(!(_rail_vehicle_info[i].flags & RVI_WAGON));
|
|
|
132 |
|
|
|
133 |
if (!HASBIT(e->player_avail, _current_player) || e->reliability < 0x8A3D)
|
|
|
134 |
continue;
|
|
|
135 |
|
|
|
136 |
r = DoCommandByTile(0, i, 0, 0, CMD_BUILD_RAIL_VEHICLE);
|
|
|
137 |
if (r != CMD_ERROR &&
|
|
|
138 |
(!(_cmd_build_rail_veh_var1&1) || !(flag&1)) &&
|
|
|
139 |
r <= money &&
|
|
|
140 |
_cmd_build_rail_veh_score >= best_veh_score) {
|
|
|
141 |
best_veh_score = _cmd_build_rail_veh_score;
|
|
|
142 |
best_veh_index = i;
|
|
|
143 |
}
|
|
|
144 |
} while (++e, ++i != end);
|
|
|
145 |
|
|
|
146 |
return best_veh_index;
|
|
|
147 |
}
|
|
|
148 |
|
|
|
149 |
static int AiChooseRoadVehToBuild(byte cargo, int32 money)
|
|
|
150 |
{
|
|
|
151 |
int best_veh_index = -1;
|
|
|
152 |
int32 best_veh_cost = 0;
|
|
|
153 |
int32 r;
|
|
|
154 |
|
|
|
155 |
int i = _cargoc.ai_roadveh_start[cargo];
|
|
|
156 |
int end = i + _cargoc.ai_roadveh_count[cargo];
|
|
|
157 |
Engine *e = &_engines[i];
|
|
|
158 |
do {
|
|
|
159 |
if (!HASBIT(e->player_avail, _current_player) || e->reliability < 0x8A3D)
|
|
|
160 |
continue;
|
|
|
161 |
|
|
|
162 |
r = DoCommandByTile(0, i, 0, 0, CMD_BUILD_ROAD_VEH);
|
|
|
163 |
if (r != CMD_ERROR && r <= money && r >= best_veh_cost) {
|
|
|
164 |
best_veh_cost = r;
|
|
|
165 |
best_veh_index = i;
|
|
|
166 |
}
|
|
|
167 |
} while (++e, ++i != end);
|
|
|
168 |
|
|
|
169 |
return best_veh_index;
|
|
|
170 |
}
|
|
|
171 |
|
|
|
172 |
static int AiChooseAircraftToBuild(int32 money, byte flag)
|
|
|
173 |
{
|
|
|
174 |
int best_veh_index = -1;
|
|
|
175 |
int32 best_veh_cost = 0;
|
|
|
176 |
int32 r;
|
|
|
177 |
|
|
|
178 |
int i = AIRCRAFT_ENGINES_INDEX;
|
|
|
179 |
int end = i + NUM_AIRCRAFT_ENGINES;
|
|
|
180 |
Engine *e = &_engines[i];
|
|
|
181 |
do {
|
|
|
182 |
if (!HASBIT(e->player_avail, _current_player) || e->reliability < 0x8A3D)
|
|
|
183 |
continue;
|
|
|
184 |
|
|
|
185 |
if (flag&1) {
|
|
|
186 |
if (i<253) continue;
|
|
|
187 |
} else {
|
|
|
188 |
if (i>=253) continue;
|
|
|
189 |
}
|
|
|
190 |
|
|
|
191 |
r = DoCommandByTile(0, i, 0, 0, CMD_BUILD_AIRCRAFT);
|
|
|
192 |
if (r != CMD_ERROR && r <= money && r >= best_veh_cost) {
|
|
|
193 |
best_veh_cost = r;
|
|
|
194 |
best_veh_index = i;
|
|
|
195 |
}
|
|
|
196 |
} while (++e, ++i != end);
|
|
|
197 |
|
|
|
198 |
return best_veh_index;
|
|
|
199 |
}
|
|
|
200 |
|
|
|
201 |
static int32 AiGetBasePrice(Player *p)
|
|
|
202 |
{
|
|
|
203 |
int32 base = _price.station_value;
|
|
|
204 |
|
|
|
205 |
// adjust base price when more expensive vehicles are available
|
|
|
206 |
if (p->ai.railtype_to_use == 1) base = (base * 3) >> 1;
|
|
|
207 |
else if (p->ai.railtype_to_use == 2) base *= 2;
|
|
|
208 |
|
|
|
209 |
return base;
|
|
|
210 |
}
|
|
|
211 |
|
|
|
212 |
#if 0
|
|
|
213 |
static int AiChooseShipToBuild(byte cargo, int32 money)
|
|
|
214 |
{
|
|
|
215 |
// XXX: not done
|
|
|
216 |
return 0;
|
|
|
217 |
}
|
|
|
218 |
#endif
|
|
|
219 |
|
|
|
220 |
static int AiChooseRoadVehToReplaceWith(Player *p, Vehicle *v)
|
|
|
221 |
{
|
|
|
222 |
int32 avail_money = p->player_money + v->value;
|
|
|
223 |
return AiChooseRoadVehToBuild(v->cargo_type, avail_money);
|
|
|
224 |
}
|
|
|
225 |
|
|
|
226 |
static int AiChooseAircraftToReplaceWith(Player *p, Vehicle *v)
|
|
|
227 |
{
|
|
|
228 |
int32 avail_money = p->player_money + v->value;
|
|
|
229 |
return AiChooseAircraftToBuild(avail_money, v->engine_type>=253?1:0);
|
|
|
230 |
}
|
|
|
231 |
|
|
|
232 |
static int AiChooseTrainToReplaceWith(Player *p, Vehicle *v)
|
|
|
233 |
{
|
|
|
234 |
int32 avail_money = p->player_money + v->value;
|
|
|
235 |
int num=0;
|
|
|
236 |
Vehicle *u = v;
|
|
|
237 |
|
|
|
238 |
while (++num, u->next != NULL) {
|
|
|
239 |
u = u->next;
|
|
|
240 |
}
|
|
|
241 |
|
|
|
242 |
// XXX: check if a wagon
|
|
|
243 |
return AiChooseTrainToBuild(v->u.rail.railtype, avail_money, 0);
|
|
|
244 |
}
|
|
|
245 |
|
|
|
246 |
static int AiChooseShipToReplaceWith(Player *p, Vehicle *v)
|
|
|
247 |
{
|
|
|
248 |
error("!AiChooseShipToReplaceWith");
|
|
|
249 |
|
|
|
250 |
/* maybe useless, but avoids compiler warning this way */
|
|
|
251 |
return 0;
|
|
|
252 |
}
|
|
|
253 |
|
|
|
254 |
static void AiHandleGotoDepot(Player *p, int cmd)
|
|
|
255 |
{
|
|
|
256 |
if ((p->ai.cur_veh->next_order & OT_MASK) != OT_GOTO_DEPOT)
|
|
|
257 |
DoCommandByTile(0, p->ai.cur_veh->index, 0, DC_EXEC, cmd);
|
|
|
258 |
|
|
|
259 |
if (++p->ai.state_counter <= 1387) {
|
|
|
260 |
p->ai.state = AIS_VEH_DO_REPLACE_VEHICLE;
|
|
|
261 |
return;
|
|
|
262 |
}
|
|
|
263 |
|
|
|
264 |
if ((p->ai.cur_veh->next_order&OT_MASK) == OT_GOTO_DEPOT) {
|
|
|
265 |
p->ai.cur_veh->next_order = OT_DUMMY;
|
|
|
266 |
InvalidateWindow(WC_VEHICLE_VIEW, p->ai.cur_veh->index);
|
|
|
267 |
}
|
|
|
268 |
}
|
|
|
269 |
|
|
|
270 |
static void AiRestoreVehicleOrders(Vehicle *v, BackuppedOrders *bak)
|
|
|
271 |
{
|
|
|
272 |
uint16 *os = bak->order, ord;
|
|
|
273 |
int ind = 0;
|
|
|
274 |
while ((ord = *os++) != 0) {
|
|
|
275 |
if (DoCommandByTile(0, v->index + (ind << 16), ord, DC_EXEC, CMD_INSERT_ORDER) == CMD_ERROR)
|
|
|
276 |
break;
|
|
|
277 |
ind++;
|
|
|
278 |
}
|
|
|
279 |
}
|
|
|
280 |
|
|
|
281 |
static void AiHandleReplaceTrain(Player *p)
|
|
|
282 |
{
|
|
|
283 |
Vehicle *v = p->ai.cur_veh;
|
|
|
284 |
BackuppedOrders orderbak[1];
|
|
|
285 |
int veh;
|
|
|
286 |
uint tile;
|
|
|
287 |
|
|
|
288 |
// wait until the vehicle reaches the depot.
|
|
|
289 |
if (!IsTrainDepotTile(v->tile) || v->u.rail.track != 0x80 || !(v->vehstatus&VS_STOPPED)) {
|
|
|
290 |
AiHandleGotoDepot(p, CMD_TRAIN_GOTO_DEPOT);
|
|
|
291 |
return;
|
|
|
292 |
}
|
|
|
293 |
|
|
|
294 |
veh = AiChooseTrainToReplaceWith(p, v);
|
|
|
295 |
if (veh != -1) {
|
|
|
296 |
BackupVehicleOrders(v, orderbak);
|
|
|
297 |
tile = v->tile;
|
|
|
298 |
|
|
|
299 |
if (DoCommandByTile(0, v->index, 2, DC_EXEC, CMD_SELL_RAIL_WAGON) != CMD_ERROR &&
|
|
|
300 |
DoCommandByTile(tile, veh, 0, DC_EXEC, CMD_BUILD_RAIL_VEHICLE) != CMD_ERROR) {
|
|
|
301 |
veh = _new_train_id;
|
|
|
302 |
AiRestoreVehicleOrders(&_vehicles[veh], orderbak);
|
|
|
303 |
DoCommandByTile(0, veh, 0, DC_EXEC, CMD_START_STOP_TRAIN);
|
|
|
304 |
}
|
|
|
305 |
}
|
|
|
306 |
}
|
|
|
307 |
|
|
|
308 |
static void AiHandleReplaceRoadVeh(Player *p)
|
|
|
309 |
{
|
|
|
310 |
Vehicle *v = p->ai.cur_veh;
|
|
|
311 |
BackuppedOrders orderbak[1];
|
|
|
312 |
int veh;
|
|
|
313 |
uint tile;
|
|
|
314 |
|
|
|
315 |
if (!IsRoadDepotTile(v->tile) || v->u.road.state != 254 || !(v->vehstatus&VS_STOPPED)) {
|
|
|
316 |
AiHandleGotoDepot(p, CMD_SEND_ROADVEH_TO_DEPOT);
|
|
|
317 |
return;
|
|
|
318 |
}
|
|
|
319 |
|
|
|
320 |
veh = AiChooseRoadVehToReplaceWith(p, v);
|
|
|
321 |
if (veh != -1) {
|
|
|
322 |
BackupVehicleOrders(v, orderbak);
|
|
|
323 |
tile = v->tile;
|
|
|
324 |
|
|
|
325 |
if (DoCommandByTile(0, v->index, 0, DC_EXEC, CMD_SELL_ROAD_VEH) != CMD_ERROR &&
|
|
|
326 |
DoCommandByTile(tile, veh, 0, DC_EXEC, CMD_BUILD_ROAD_VEH) != CMD_ERROR) {
|
|
|
327 |
veh = _new_roadveh_id;
|
|
|
328 |
AiRestoreVehicleOrders(&_vehicles[veh], orderbak);
|
|
|
329 |
DoCommandByTile(0, veh, 0, DC_EXEC, CMD_START_STOP_ROADVEH);
|
|
|
330 |
}
|
|
|
331 |
}
|
|
|
332 |
}
|
|
|
333 |
|
|
|
334 |
static void AiHandleReplaceAircraft(Player *p)
|
|
|
335 |
{
|
|
|
336 |
Vehicle *v = p->ai.cur_veh;
|
|
|
337 |
int veh;
|
|
|
338 |
BackuppedOrders orderbak[1];
|
|
|
339 |
uint tile;
|
|
|
340 |
|
|
|
341 |
if (!IsAircraftHangarTile(v->tile) && !(v->vehstatus&VS_STOPPED)) {
|
|
|
342 |
AiHandleGotoDepot(p, CMD_SEND_AIRCRAFT_TO_HANGAR);
|
|
|
343 |
return;
|
|
|
344 |
}
|
|
|
345 |
|
|
|
346 |
veh = AiChooseAircraftToReplaceWith(p, v);
|
|
|
347 |
if (veh != -1) {
|
|
|
348 |
BackupVehicleOrders(v, orderbak);
|
|
|
349 |
tile = v->tile;
|
|
|
350 |
|
|
|
351 |
if (DoCommandByTile(0, v->index, 0, DC_EXEC, CMD_SELL_AIRCRAFT) != CMD_ERROR &&
|
|
|
352 |
DoCommandByTile(tile, veh, 0, DC_EXEC, CMD_BUILD_AIRCRAFT) != CMD_ERROR) {
|
|
|
353 |
veh = _new_aircraft_id;
|
|
|
354 |
AiRestoreVehicleOrders(&_vehicles[veh], orderbak);
|
|
|
355 |
DoCommandByTile(0, veh, 0, DC_EXEC, CMD_START_STOP_AIRCRAFT);
|
|
|
356 |
}
|
|
|
357 |
}
|
|
|
358 |
}
|
|
|
359 |
|
|
|
360 |
static void AiHandleReplaceShip(Player *p)
|
|
|
361 |
{
|
|
|
362 |
error("!AiHandleReplaceShip");
|
|
|
363 |
}
|
|
|
364 |
|
|
|
365 |
typedef int CheckReplaceProc(Player *p, Vehicle *v);
|
|
|
366 |
|
|
|
367 |
static CheckReplaceProc * const _veh_check_replace_proc[] = {
|
|
|
368 |
AiChooseTrainToReplaceWith,
|
|
|
369 |
AiChooseRoadVehToReplaceWith,
|
|
|
370 |
AiChooseShipToReplaceWith,
|
|
|
371 |
AiChooseAircraftToReplaceWith,
|
|
|
372 |
};
|
|
|
373 |
|
|
|
374 |
typedef void DoReplaceProc(Player *p);
|
|
|
375 |
static DoReplaceProc * const _veh_do_replace_proc[] = {
|
|
|
376 |
AiHandleReplaceTrain,
|
|
|
377 |
AiHandleReplaceRoadVeh,
|
|
|
378 |
AiHandleReplaceShip,
|
|
|
379 |
AiHandleReplaceAircraft
|
|
|
380 |
};
|
|
|
381 |
|
|
|
382 |
static void AiStateCheckReplaceVehicle(Player *p)
|
|
|
383 |
{
|
|
|
384 |
Vehicle *v = p->ai.cur_veh;
|
|
|
385 |
|
|
|
386 |
if (v->type == 0 || v->owner != _current_player || v->type > VEH_Ship || _veh_check_replace_proc[v->type - VEH_Train](p, v) == -1) {
|
|
|
387 |
p->ai.state = AIS_VEH_LOOP;
|
|
|
388 |
} else {
|
|
|
389 |
p->ai.state_counter = 0;
|
|
|
390 |
p->ai.state = AIS_VEH_DO_REPLACE_VEHICLE;
|
|
|
391 |
}
|
|
|
392 |
}
|
|
|
393 |
|
|
|
394 |
static void AiStateDoReplaceVehicle(Player *p)
|
|
|
395 |
{
|
|
|
396 |
Vehicle *v = p->ai.cur_veh;
|
|
|
397 |
p->ai.state = AIS_VEH_LOOP;
|
|
|
398 |
// vehicle is not owned by the player anymore, something went very wrong.
|
|
|
399 |
if (v->type == 0 || v->owner != _current_player)
|
|
|
400 |
return;
|
|
|
401 |
_veh_do_replace_proc[v->type - VEH_Train](p);
|
|
|
402 |
}
|
|
|
403 |
|
|
|
404 |
typedef struct FoundRoute {
|
|
|
405 |
int distance;
|
|
|
406 |
byte cargo;
|
|
|
407 |
void *from;
|
|
|
408 |
void *to;
|
|
|
409 |
} FoundRoute;
|
|
|
410 |
|
|
|
411 |
static Town *AiFindRandomTown() {
|
|
|
412 |
Town *t = DEREF_TOWN(RandomRange(_total_towns));
|
|
|
413 |
return (t->xy != 0) ? t : NULL;
|
|
|
414 |
}
|
|
|
415 |
|
|
|
416 |
static Industry *AiFindRandomIndustry() {
|
|
|
417 |
Industry *i = DEREF_INDUSTRY(RandomRange(_total_industries));
|
|
|
418 |
return (i->xy != 0) ? i : NULL;
|
|
|
419 |
}
|
|
|
420 |
|
|
|
421 |
static void AiFindSubsidyIndustryRoute(FoundRoute *fr)
|
|
|
422 |
{
|
|
|
423 |
int i;
|
|
|
424 |
byte cargo;
|
|
|
425 |
Subsidy *s;
|
|
|
426 |
Industry *from, *to_ind;
|
|
|
427 |
Town *to_tow;
|
|
|
428 |
TileIndex to_xy;
|
|
|
429 |
|
|
|
430 |
// initially error
|
|
|
431 |
fr->distance = -1;
|
|
|
432 |
|
|
|
433 |
// Randomize subsidy index..
|
|
|
434 |
i = RandomRange(lengthof(_subsidies) * 3);
|
|
|
435 |
if (i >= lengthof(_subsidies))
|
|
|
436 |
return;
|
|
|
437 |
|
|
|
438 |
s = &_subsidies[i];
|
|
|
439 |
|
|
|
440 |
// Don't want passengers or mail
|
|
|
441 |
cargo = s->cargo_type;
|
|
|
442 |
if (cargo == 0xFF || cargo == CT_PASSENGERS || cargo == CT_MAIL || s->age > 7)
|
|
|
443 |
return;
|
|
|
444 |
fr->cargo = cargo;
|
|
|
445 |
|
|
|
446 |
fr->from = from = DEREF_INDUSTRY(s->from);
|
|
|
447 |
|
|
|
448 |
if (cargo == CT_GOODS || cargo == CT_FOOD) {
|
|
|
449 |
to_tow = DEREF_TOWN(s->to);
|
|
|
450 |
if (to_tow->population < (uint32)(cargo == CT_FOOD ? 200 : 900))
|
|
|
451 |
return; // error
|
|
|
452 |
fr->to = to_tow;
|
|
|
453 |
to_xy = to_tow->xy;
|
|
|
454 |
} else {
|
|
|
455 |
to_ind = DEREF_INDUSTRY(s->to);
|
|
|
456 |
fr->to = to_ind;
|
|
|
457 |
to_xy = to_ind->xy;
|
|
|
458 |
}
|
|
|
459 |
|
|
|
460 |
fr->distance = GetTileDist(from->xy, to_xy);
|
|
|
461 |
}
|
|
|
462 |
|
|
|
463 |
static void AiFindSubsidyPassengerRoute(FoundRoute *fr)
|
|
|
464 |
{
|
|
|
465 |
uint i;
|
|
|
466 |
Subsidy *s;
|
|
|
467 |
Town *from,*to;
|
|
|
468 |
|
|
|
469 |
// initially error
|
|
|
470 |
fr->distance = -1;
|
|
|
471 |
|
|
|
472 |
// Randomize subsidy index..
|
|
|
473 |
i = RandomRange(lengthof(_subsidies) * 3);
|
|
|
474 |
if (i >= lengthof(_subsidies))
|
|
|
475 |
return;
|
|
|
476 |
|
|
|
477 |
s = &_subsidies[i];
|
|
|
478 |
|
|
|
479 |
// Only want passengers
|
|
|
480 |
if (s->cargo_type != CT_PASSENGERS || s->age > 7)
|
|
|
481 |
return;
|
|
|
482 |
fr->cargo = s->cargo_type;
|
|
|
483 |
|
|
|
484 |
fr->from = from = DEREF_TOWN(s->from);
|
|
|
485 |
fr->to = to = DEREF_TOWN(s->to);
|
|
|
486 |
|
|
|
487 |
// They must be big enough
|
|
|
488 |
if (from->population < 400 || to->population < 400)
|
|
|
489 |
return;
|
|
|
490 |
|
|
|
491 |
fr->distance = GetTileDist(from->xy, to->xy);
|
|
|
492 |
}
|
|
|
493 |
|
|
|
494 |
static void AiFindRandomIndustryRoute(FoundRoute *fr)
|
|
|
495 |
{
|
|
|
496 |
Industry *i,*i2;
|
|
|
497 |
Town *t;
|
|
|
498 |
uint32 r;
|
|
|
499 |
byte cargo;
|
|
|
500 |
|
|
|
501 |
// initially error
|
|
|
502 |
fr->distance = -1;
|
|
|
503 |
|
|
|
504 |
r = Random();
|
|
|
505 |
|
|
|
506 |
// pick a source
|
|
|
507 |
fr->from = i = AiFindRandomIndustry();
|
|
|
508 |
if (i == NULL)
|
|
|
509 |
return;
|
|
|
510 |
|
|
|
511 |
// pick a random produced cargo
|
|
|
512 |
cargo = i->produced_cargo[0];
|
|
|
513 |
if (r&1 && i->produced_cargo[1] != 0xFF)
|
|
|
514 |
cargo = i->produced_cargo[1];
|
|
|
515 |
|
|
|
516 |
fr->cargo = cargo;
|
|
|
517 |
|
|
|
518 |
// don't allow passengers
|
|
|
519 |
if (cargo == 0xFF || cargo == CT_PASSENGERS)
|
|
|
520 |
return;
|
|
|
521 |
|
|
|
522 |
if (cargo != CT_GOODS && cargo != CT_FOOD) {
|
|
|
523 |
// pick a dest, and see if it can receive
|
|
|
524 |
i2 = AiFindRandomIndustry();
|
|
|
525 |
if (i2 == NULL || i == i2 || !(i2->accepts_cargo[0] == cargo || i2->accepts_cargo[1] == cargo || i2->accepts_cargo[2] == cargo))
|
|
|
526 |
return;
|
|
|
527 |
|
|
|
528 |
fr->to = i2;
|
|
|
529 |
fr->distance = GetTileDist(i->xy, i2->xy);
|
|
|
530 |
} else {
|
|
|
531 |
// pick a dest town, and see if it's big enough
|
|
|
532 |
t = AiFindRandomTown();
|
|
|
533 |
if (t == NULL || t->population < (uint32)(cargo == CT_FOOD ? 200 : 900))
|
|
|
534 |
return;
|
|
|
535 |
|
|
|
536 |
fr->to = t;
|
|
|
537 |
fr->distance = GetTileDist(i->xy, t->xy);
|
|
|
538 |
}
|
|
|
539 |
}
|
|
|
540 |
|
|
|
541 |
static void AiFindRandomPassengerRoute(FoundRoute *fr)
|
|
|
542 |
{
|
|
|
543 |
uint32 r;
|
|
|
544 |
Town *source, *dest;
|
|
|
545 |
|
|
|
546 |
// initially error
|
|
|
547 |
fr->distance = -1;
|
|
|
548 |
|
|
|
549 |
r = Random();
|
|
|
550 |
|
|
|
551 |
fr->from = source = AiFindRandomTown();
|
|
|
552 |
if (source == NULL || source->population < 400)
|
|
|
553 |
return;
|
|
|
554 |
|
|
|
555 |
fr->to = dest = AiFindRandomTown();
|
|
|
556 |
if (dest == NULL || source == dest || dest->population < 400)
|
|
|
557 |
return;
|
|
|
558 |
|
|
|
559 |
fr->distance = GetTileDist(source->xy, dest->xy);
|
|
|
560 |
}
|
|
|
561 |
|
|
|
562 |
// Warn: depends on 'xy' being the first element in both Town and Industry
|
|
|
563 |
#define GET_TOWN_OR_INDUSTRY_TILE(p) (((Town*)(p))->xy)
|
|
|
564 |
|
|
|
565 |
static bool AiCheckIfRouteIsGood(Player *p, FoundRoute *fr, byte bitmask)
|
|
|
566 |
{
|
|
|
567 |
TileIndex from_tile, to_tile;
|
|
|
568 |
Station *st;
|
|
|
569 |
int dist, cur;
|
|
|
570 |
uint same_station = 0;
|
|
|
571 |
|
|
|
572 |
// Make sure distance to closest station is < 37 pixels.
|
|
|
573 |
from_tile = GET_TOWN_OR_INDUSTRY_TILE(fr->from);
|
|
|
574 |
to_tile = GET_TOWN_OR_INDUSTRY_TILE(fr->to);
|
|
|
575 |
|
|
|
576 |
dist = 0xFFFF;
|
|
|
577 |
FOR_ALL_STATIONS(st) if (st->xy != 0 && st->owner == _current_player) {
|
|
|
578 |
cur = GetTileDist1D(from_tile, st->xy);
|
|
|
579 |
if (cur < dist) dist = cur;
|
|
|
580 |
cur = GetTileDist1D(to_tile, st->xy);
|
|
|
581 |
if (cur < dist) dist = cur;
|
|
|
582 |
if (to_tile == from_tile && st->xy == to_tile)
|
|
|
583 |
same_station++;
|
|
|
584 |
}
|
|
|
585 |
|
|
|
586 |
// To prevent the AI from building ten busstations in the same town, do some calculations
|
|
|
587 |
// For each road or airport station, we want 350 of population!
|
|
|
588 |
if ((bitmask == 2 || bitmask == 4) && same_station > 2 && ((Town *)(fr->from))->population < same_station * 350)
|
|
|
589 |
return false;
|
|
|
590 |
|
|
|
591 |
if (dist != 0xFFFF && dist > 37)
|
|
|
592 |
return false;
|
|
|
593 |
|
|
|
594 |
if (p->ai.route_type_mask != 0 && !(p->ai.route_type_mask&bitmask) && !CHANCE16(1,5))
|
|
|
595 |
return false;
|
|
|
596 |
|
|
|
597 |
if (fr->cargo == CT_PASSENGERS || fr->cargo == CT_MAIL) {
|
|
|
598 |
if (((Town*)fr->from)->pct_pass_transported > 0x99 ||
|
|
|
599 |
((Town*)fr->to)->pct_pass_transported > 0x99)
|
|
|
600 |
return false;
|
|
|
601 |
|
|
|
602 |
// Make sure it has a reasonably good rating
|
|
|
603 |
if ( ((Town*)fr->from)->ratings[_current_player] < -100 ||
|
|
|
604 |
((Town*)fr->to)->ratings[_current_player] < -100)
|
|
|
605 |
return false;
|
|
|
606 |
} else {
|
|
|
607 |
Industry *i = (Industry*)fr->from;
|
|
|
608 |
|
|
|
609 |
if (i->pct_transported[fr->cargo != i->produced_cargo[0]] > 0x99 ||
|
|
|
610 |
i->total_production[fr->cargo != i->produced_cargo[0]] == 0)
|
|
|
611 |
return false;
|
|
|
612 |
}
|
|
|
613 |
|
|
|
614 |
p->ai.route_type_mask |= bitmask;
|
|
|
615 |
return true;
|
|
|
616 |
}
|
|
|
617 |
|
|
|
618 |
static byte AiGetDirectionBetweenTiles(TileIndex a, TileIndex b)
|
|
|
619 |
{
|
|
|
620 |
byte i = (GET_TILE_X(a) < GET_TILE_X(b)) ? 1 : 0;
|
|
|
621 |
if (GET_TILE_Y(a) >= GET_TILE_Y(b)) i ^= 3;
|
|
|
622 |
return i;
|
|
|
623 |
}
|
|
|
624 |
|
|
|
625 |
static TileIndex AiGetPctTileBetween(TileIndex a, TileIndex b, byte pct)
|
|
|
626 |
{
|
|
|
627 |
return TILE_XY(
|
|
|
628 |
GET_TILE_X(a) + ((GET_TILE_X(b) - GET_TILE_X(a)) * pct >> 8),
|
|
|
629 |
GET_TILE_Y(a) + ((GET_TILE_Y(b) - GET_TILE_Y(a)) * pct >> 8)
|
|
|
630 |
);
|
|
|
631 |
}
|
|
|
632 |
|
|
|
633 |
static void AiWantLongIndustryRoute(Player *p)
|
|
|
634 |
{
|
|
|
635 |
int i;
|
|
|
636 |
FoundRoute fr;
|
|
|
637 |
|
|
|
638 |
i = 60;
|
|
|
639 |
for(;;) {
|
|
|
640 |
// look for one from the subsidy list
|
|
|
641 |
AiFindSubsidyIndustryRoute(&fr);
|
|
|
642 |
if (IS_INT_INSIDE(fr.distance, 60, 90+1))
|
|
|
643 |
break;
|
|
|
644 |
|
|
|
645 |
// try a random one
|
|
|
646 |
AiFindRandomIndustryRoute(&fr);
|
|
|
647 |
if (IS_INT_INSIDE(fr.distance, 60, 90+1))
|
|
|
648 |
break;
|
|
|
649 |
|
|
|
650 |
// only test 60 times
|
|
|
651 |
if (--i == 0)
|
|
|
652 |
return;
|
|
|
653 |
}
|
|
|
654 |
|
|
|
655 |
if (!AiCheckIfRouteIsGood(p, &fr, 1))
|
|
|
656 |
return;
|
|
|
657 |
|
|
|
658 |
// Fill the source field
|
|
|
659 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
660 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
661 |
|
|
|
662 |
p->ai.src.use_tile = 0;
|
|
|
663 |
p->ai.src.rand_rng = 9;
|
|
|
664 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
665 |
p->ai.src.unk6 = 1;
|
|
|
666 |
p->ai.src.unk7 = 0;
|
|
|
667 |
p->ai.src.buildcmd_a = 0x24;
|
|
|
668 |
p->ai.src.buildcmd_b = 0xFF;
|
|
|
669 |
p->ai.src.direction = AiGetDirectionBetweenTiles(
|
|
|
670 |
p->ai.src.spec_tile,
|
|
|
671 |
p->ai.dst.spec_tile
|
|
|
672 |
);
|
|
|
673 |
p->ai.src.cargo = fr.cargo | 0x80;
|
|
|
674 |
|
|
|
675 |
// Fill the dest field
|
|
|
676 |
|
|
|
677 |
p->ai.dst.use_tile = 0;
|
|
|
678 |
p->ai.dst.rand_rng = 9;
|
|
|
679 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
680 |
p->ai.dst.unk6 = 1;
|
|
|
681 |
p->ai.dst.unk7 = 0;
|
|
|
682 |
p->ai.dst.buildcmd_a = 0x34;
|
|
|
683 |
p->ai.dst.buildcmd_b = 0xFF;
|
|
|
684 |
p->ai.dst.direction = AiGetDirectionBetweenTiles(
|
|
|
685 |
p->ai.dst.spec_tile,
|
|
|
686 |
p->ai.src.spec_tile
|
|
|
687 |
);
|
|
|
688 |
p->ai.dst.cargo = fr.cargo;
|
|
|
689 |
|
|
|
690 |
// Fill middle field 1
|
|
|
691 |
p->ai.mid1.spec_tile = AiGetPctTileBetween(
|
|
|
692 |
p->ai.src.spec_tile,
|
|
|
693 |
p->ai.dst.spec_tile,
|
|
|
694 |
0x55
|
|
|
695 |
);
|
|
|
696 |
p->ai.mid1.use_tile = 0;
|
|
|
697 |
p->ai.mid1.rand_rng = 6;
|
|
|
698 |
p->ai.mid1.cur_building_rule = 0xFF;
|
|
|
699 |
p->ai.mid1.unk6 = 2;
|
|
|
700 |
p->ai.mid1.unk7 = 1;
|
|
|
701 |
p->ai.mid1.buildcmd_a = 0x30;
|
|
|
702 |
p->ai.mid1.buildcmd_b = 0xFF;
|
|
|
703 |
p->ai.mid1.direction = p->ai.src.direction;
|
|
|
704 |
p->ai.mid1.cargo = fr.cargo;
|
|
|
705 |
|
|
|
706 |
// Fill middle field 2
|
|
|
707 |
p->ai.mid2.spec_tile = AiGetPctTileBetween(
|
|
|
708 |
p->ai.src.spec_tile,
|
|
|
709 |
p->ai.dst.spec_tile,
|
|
|
710 |
0xAA
|
|
|
711 |
);
|
|
|
712 |
p->ai.mid2.use_tile = 0;
|
|
|
713 |
p->ai.mid2.rand_rng = 6;
|
|
|
714 |
p->ai.mid2.cur_building_rule = 0xFF;
|
|
|
715 |
p->ai.mid2.unk6 = 2;
|
|
|
716 |
p->ai.mid2.unk7 = 1;
|
|
|
717 |
p->ai.mid2.buildcmd_a = 0xFF;
|
|
|
718 |
p->ai.mid2.buildcmd_b = 0xFF;
|
|
|
719 |
p->ai.mid2.direction = p->ai.dst.direction;
|
|
|
720 |
p->ai.mid2.cargo = fr.cargo;
|
|
|
721 |
|
|
|
722 |
// Fill common fields
|
|
|
723 |
p->ai.cargo_type = fr.cargo;
|
|
|
724 |
p->ai.num_wagons = 3;
|
|
|
725 |
p->ai.build_kind = 2;
|
|
|
726 |
p->ai.num_build_rec = 4;
|
|
|
727 |
p->ai.num_loco_to_build = 2;
|
|
|
728 |
p->ai.num_want_fullload = 2;
|
|
|
729 |
p->ai.wagon_list[0] = INVALID_VEHICLE;
|
|
|
730 |
p->ai.order_list_blocks[0] = 0;
|
|
|
731 |
p->ai.order_list_blocks[1] = 1;
|
|
|
732 |
p->ai.order_list_blocks[2] = 255;
|
|
|
733 |
|
|
|
734 |
p->ai.state = AIS_BUILD_DEFAULT_RAIL_BLOCKS;
|
|
|
735 |
p->ai.state_mode = -1;
|
|
|
736 |
p->ai.state_counter = 0;
|
|
|
737 |
p->ai.timeout_counter = 0;
|
|
|
738 |
}
|
|
|
739 |
|
|
|
740 |
static void AiWantMediumIndustryRoute(Player *p)
|
|
|
741 |
{
|
|
|
742 |
int i;
|
|
|
743 |
FoundRoute fr;
|
|
|
744 |
|
|
|
745 |
i = 60;
|
|
|
746 |
for(;;) {
|
|
|
747 |
|
|
|
748 |
// look for one from the subsidy list
|
|
|
749 |
AiFindSubsidyIndustryRoute(&fr);
|
|
|
750 |
if (IS_INT_INSIDE(fr.distance, 40, 60+1))
|
|
|
751 |
break;
|
|
|
752 |
|
|
|
753 |
// try a random one
|
|
|
754 |
AiFindRandomIndustryRoute(&fr);
|
|
|
755 |
if (IS_INT_INSIDE(fr.distance, 40, 60+1))
|
|
|
756 |
break;
|
|
|
757 |
|
|
|
758 |
// only test 60 times
|
|
|
759 |
if (--i == 0)
|
|
|
760 |
return;
|
|
|
761 |
}
|
|
|
762 |
|
|
|
763 |
if (!AiCheckIfRouteIsGood(p, &fr, 1))
|
|
|
764 |
return;
|
|
|
765 |
|
|
|
766 |
// Fill the source field
|
|
|
767 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
768 |
p->ai.src.use_tile = 0;
|
|
|
769 |
p->ai.src.rand_rng = 9;
|
|
|
770 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
771 |
p->ai.src.unk6 = 1;
|
|
|
772 |
p->ai.src.unk7 = 0;
|
|
|
773 |
p->ai.src.buildcmd_a = 0x10;
|
|
|
774 |
p->ai.src.buildcmd_b = 0xFF;
|
|
|
775 |
p->ai.src.direction = AiGetDirectionBetweenTiles(
|
|
|
776 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from),
|
|
|
777 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to)
|
|
|
778 |
);
|
|
|
779 |
p->ai.src.cargo = fr.cargo | 0x80;
|
|
|
780 |
|
|
|
781 |
// Fill the dest field
|
|
|
782 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
783 |
p->ai.dst.use_tile = 0;
|
|
|
784 |
p->ai.dst.rand_rng = 9;
|
|
|
785 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
786 |
p->ai.dst.unk6 = 1;
|
|
|
787 |
p->ai.dst.unk7 = 0;
|
|
|
788 |
p->ai.dst.buildcmd_a = 0xFF;
|
|
|
789 |
p->ai.dst.buildcmd_b = 0xFF;
|
|
|
790 |
p->ai.dst.direction = AiGetDirectionBetweenTiles(
|
|
|
791 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to),
|
|
|
792 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from)
|
|
|
793 |
);
|
|
|
794 |
p->ai.dst.cargo = fr.cargo;
|
|
|
795 |
|
|
|
796 |
// Fill common fields
|
|
|
797 |
p->ai.cargo_type = fr.cargo;
|
|
|
798 |
p->ai.num_wagons = 3;
|
|
|
799 |
p->ai.build_kind = 1;
|
|
|
800 |
p->ai.num_build_rec = 2;
|
|
|
801 |
p->ai.num_loco_to_build = 1;
|
|
|
802 |
p->ai.num_want_fullload = 1;
|
|
|
803 |
p->ai.wagon_list[0] = INVALID_VEHICLE;
|
|
|
804 |
p->ai.order_list_blocks[0] = 0;
|
|
|
805 |
p->ai.order_list_blocks[1] = 1;
|
|
|
806 |
p->ai.order_list_blocks[2] = 255;
|
|
|
807 |
p->ai.state = AIS_BUILD_DEFAULT_RAIL_BLOCKS;
|
|
|
808 |
p->ai.state_mode = -1;
|
|
|
809 |
p->ai.state_counter = 0;
|
|
|
810 |
p->ai.timeout_counter = 0;
|
|
|
811 |
}
|
|
|
812 |
|
|
|
813 |
static void AiWantShortIndustryRoute(Player *p)
|
|
|
814 |
{
|
|
|
815 |
int i;
|
|
|
816 |
FoundRoute fr;
|
|
|
817 |
|
|
|
818 |
i = 60;
|
|
|
819 |
for(;;) {
|
|
|
820 |
|
|
|
821 |
// look for one from the subsidy list
|
|
|
822 |
AiFindSubsidyIndustryRoute(&fr);
|
|
|
823 |
if (IS_INT_INSIDE(fr.distance, 15, 40+1))
|
|
|
824 |
break;
|
|
|
825 |
|
|
|
826 |
// try a random one
|
|
|
827 |
AiFindRandomIndustryRoute(&fr);
|
|
|
828 |
if (IS_INT_INSIDE(fr.distance, 15, 40+1))
|
|
|
829 |
break;
|
|
|
830 |
|
|
|
831 |
// only test 60 times
|
|
|
832 |
if (--i == 0)
|
|
|
833 |
return;
|
|
|
834 |
}
|
|
|
835 |
|
|
|
836 |
if (!AiCheckIfRouteIsGood(p, &fr, 1))
|
|
|
837 |
return;
|
|
|
838 |
|
|
|
839 |
// Fill the source field
|
|
|
840 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
841 |
p->ai.src.use_tile = 0;
|
|
|
842 |
p->ai.src.rand_rng = 9;
|
|
|
843 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
844 |
p->ai.src.unk6 = 1;
|
|
|
845 |
p->ai.src.unk7 = 0;
|
|
|
846 |
p->ai.src.buildcmd_a = 0x10;
|
|
|
847 |
p->ai.src.buildcmd_b = 0xFF;
|
|
|
848 |
p->ai.src.direction = AiGetDirectionBetweenTiles(
|
|
|
849 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from),
|
|
|
850 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to)
|
|
|
851 |
);
|
|
|
852 |
p->ai.src.cargo = fr.cargo | 0x80;
|
|
|
853 |
|
|
|
854 |
// Fill the dest field
|
|
|
855 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
856 |
p->ai.dst.use_tile = 0;
|
|
|
857 |
p->ai.dst.rand_rng = 9;
|
|
|
858 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
859 |
p->ai.dst.unk6 = 1;
|
|
|
860 |
p->ai.dst.unk7 = 0;
|
|
|
861 |
p->ai.dst.buildcmd_a = 0xFF;
|
|
|
862 |
p->ai.dst.buildcmd_b = 0xFF;
|
|
|
863 |
p->ai.dst.direction = AiGetDirectionBetweenTiles(
|
|
|
864 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to),
|
|
|
865 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from)
|
|
|
866 |
);
|
|
|
867 |
p->ai.dst.cargo = fr.cargo;
|
|
|
868 |
|
|
|
869 |
// Fill common fields
|
|
|
870 |
p->ai.cargo_type = fr.cargo;
|
|
|
871 |
p->ai.num_wagons = 2;
|
|
|
872 |
p->ai.build_kind = 1;
|
|
|
873 |
p->ai.num_build_rec = 2;
|
|
|
874 |
p->ai.num_loco_to_build = 1;
|
|
|
875 |
p->ai.num_want_fullload = 1;
|
|
|
876 |
p->ai.wagon_list[0] = INVALID_VEHICLE;
|
|
|
877 |
p->ai.order_list_blocks[0] = 0;
|
|
|
878 |
p->ai.order_list_blocks[1] = 1;
|
|
|
879 |
p->ai.order_list_blocks[2] = 255;
|
|
|
880 |
p->ai.state = AIS_BUILD_DEFAULT_RAIL_BLOCKS;
|
|
|
881 |
p->ai.state_mode = -1;
|
|
|
882 |
p->ai.state_counter = 0;
|
|
|
883 |
p->ai.timeout_counter = 0;
|
|
|
884 |
}
|
|
|
885 |
|
|
|
886 |
static void AiWantMailRoute(Player *p)
|
|
|
887 |
{
|
|
|
888 |
int i;
|
|
|
889 |
FoundRoute fr;
|
|
|
890 |
|
|
|
891 |
i = 60;
|
|
|
892 |
for(;;) {
|
|
|
893 |
|
|
|
894 |
// look for one from the subsidy list
|
|
|
895 |
AiFindSubsidyPassengerRoute(&fr);
|
|
|
896 |
if (IS_INT_INSIDE(fr.distance, 60, 110+1))
|
|
|
897 |
break;
|
|
|
898 |
|
|
|
899 |
// try a random one
|
|
|
900 |
AiFindRandomPassengerRoute(&fr);
|
|
|
901 |
if (IS_INT_INSIDE(fr.distance, 60, 110+1))
|
|
|
902 |
break;
|
|
|
903 |
|
|
|
904 |
// only test 60 times
|
|
|
905 |
if (--i == 0)
|
|
|
906 |
return;
|
|
|
907 |
}
|
|
|
908 |
|
|
|
909 |
fr.cargo = CT_MAIL;
|
|
|
910 |
if (!AiCheckIfRouteIsGood(p, &fr, 1))
|
|
|
911 |
return;
|
|
|
912 |
|
|
|
913 |
// Fill the source field
|
|
|
914 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
915 |
p->ai.src.use_tile = 0;
|
|
|
916 |
p->ai.src.rand_rng = 7;
|
|
|
917 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
918 |
p->ai.src.unk6 = 1;
|
|
|
919 |
p->ai.src.unk7 = 0;
|
|
|
920 |
p->ai.src.buildcmd_a = 0x24;
|
|
|
921 |
p->ai.src.buildcmd_b = 0xFF;
|
|
|
922 |
p->ai.src.direction = AiGetDirectionBetweenTiles(
|
|
|
923 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from),
|
|
|
924 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to)
|
|
|
925 |
);
|
|
|
926 |
p->ai.src.cargo = fr.cargo;
|
|
|
927 |
|
|
|
928 |
// Fill the dest field
|
|
|
929 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
930 |
p->ai.dst.use_tile = 0;
|
|
|
931 |
p->ai.dst.rand_rng = 7;
|
|
|
932 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
933 |
p->ai.dst.unk6 = 1;
|
|
|
934 |
p->ai.dst.unk7 = 0;
|
|
|
935 |
p->ai.dst.buildcmd_a = 0x34;
|
|
|
936 |
p->ai.dst.buildcmd_b = 0xFF;
|
|
|
937 |
p->ai.dst.direction = AiGetDirectionBetweenTiles(
|
|
|
938 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to),
|
|
|
939 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from)
|
|
|
940 |
);
|
|
|
941 |
p->ai.dst.cargo = fr.cargo;
|
|
|
942 |
|
|
|
943 |
// Fill middle field 1
|
|
|
944 |
p->ai.mid1.spec_tile = AiGetPctTileBetween(
|
|
|
945 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from),
|
|
|
946 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to),
|
|
|
947 |
0x55
|
|
|
948 |
);
|
|
|
949 |
p->ai.mid1.use_tile = 0;
|
|
|
950 |
p->ai.mid1.rand_rng = 6;
|
|
|
951 |
p->ai.mid1.cur_building_rule = 0xFF;
|
|
|
952 |
p->ai.mid1.unk6 = 2;
|
|
|
953 |
p->ai.mid1.unk7 = 1;
|
|
|
954 |
p->ai.mid1.buildcmd_a = 0x30;
|
|
|
955 |
p->ai.mid1.buildcmd_b = 0xFF;
|
|
|
956 |
p->ai.mid1.direction = p->ai.src.direction;
|
|
|
957 |
p->ai.mid1.cargo = fr.cargo;
|
|
|
958 |
|
|
|
959 |
// Fill middle field 2
|
|
|
960 |
p->ai.mid2.spec_tile = AiGetPctTileBetween(
|
|
|
961 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from),
|
|
|
962 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to),
|
|
|
963 |
0xAA
|
|
|
964 |
);
|
|
|
965 |
p->ai.mid2.use_tile = 0;
|
|
|
966 |
p->ai.mid2.rand_rng = 6;
|
|
|
967 |
p->ai.mid2.cur_building_rule = 0xFF;
|
|
|
968 |
p->ai.mid2.unk6 = 2;
|
|
|
969 |
p->ai.mid2.unk7 = 1;
|
|
|
970 |
p->ai.mid2.buildcmd_a = 0xFF;
|
|
|
971 |
p->ai.mid2.buildcmd_b = 0xFF;
|
|
|
972 |
p->ai.mid2.direction = p->ai.dst.direction;
|
|
|
973 |
p->ai.mid2.cargo = fr.cargo;
|
|
|
974 |
|
|
|
975 |
// Fill common fields
|
|
|
976 |
p->ai.cargo_type = fr.cargo;
|
|
|
977 |
p->ai.num_wagons = 3;
|
|
|
978 |
p->ai.build_kind = 2;
|
|
|
979 |
p->ai.num_build_rec = 4;
|
|
|
980 |
p->ai.num_loco_to_build = 2;
|
|
|
981 |
p->ai.num_want_fullload = 0;
|
|
|
982 |
p->ai.wagon_list[0] = INVALID_VEHICLE;
|
|
|
983 |
p->ai.order_list_blocks[0] = 0;
|
|
|
984 |
p->ai.order_list_blocks[1] = 1;
|
|
|
985 |
p->ai.order_list_blocks[2] = 255;
|
|
|
986 |
p->ai.state = AIS_BUILD_DEFAULT_RAIL_BLOCKS;
|
|
|
987 |
p->ai.state_mode = -1;
|
|
|
988 |
p->ai.state_counter = 0;
|
|
|
989 |
p->ai.timeout_counter = 0;
|
|
|
990 |
}
|
|
|
991 |
|
|
|
992 |
static void AiWantPassengerRoute(Player *p)
|
|
|
993 |
{
|
|
|
994 |
int i;
|
|
|
995 |
FoundRoute fr;
|
|
|
996 |
|
|
|
997 |
i = 60;
|
|
|
998 |
for(;;) {
|
|
|
999 |
|
|
|
1000 |
// look for one from the subsidy list
|
|
|
1001 |
AiFindSubsidyPassengerRoute(&fr);
|
|
|
1002 |
if (IS_INT_INSIDE(fr.distance, 0, 55+1))
|
|
|
1003 |
break;
|
|
|
1004 |
|
|
|
1005 |
// try a random one
|
|
|
1006 |
AiFindRandomPassengerRoute(&fr);
|
|
|
1007 |
if (IS_INT_INSIDE(fr.distance, 0, 55+1))
|
|
|
1008 |
break;
|
|
|
1009 |
|
|
|
1010 |
// only test 60 times
|
|
|
1011 |
if (--i == 0)
|
|
|
1012 |
return;
|
|
|
1013 |
}
|
|
|
1014 |
|
|
|
1015 |
fr.cargo = CT_PASSENGERS;
|
|
|
1016 |
if (!AiCheckIfRouteIsGood(p, &fr, 1))
|
|
|
1017 |
return;
|
|
|
1018 |
|
|
|
1019 |
// Fill the source field
|
|
|
1020 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
1021 |
p->ai.src.use_tile = 0;
|
|
|
1022 |
p->ai.src.rand_rng = 7;
|
|
|
1023 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
1024 |
p->ai.src.unk6 = 1;
|
|
|
1025 |
p->ai.src.unk7 = 0;
|
|
|
1026 |
p->ai.src.buildcmd_a = 0x10;
|
|
|
1027 |
p->ai.src.buildcmd_b = 0xFF;
|
|
|
1028 |
p->ai.src.direction = AiGetDirectionBetweenTiles(
|
|
|
1029 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from),
|
|
|
1030 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to)
|
|
|
1031 |
);
|
|
|
1032 |
p->ai.src.cargo = fr.cargo;
|
|
|
1033 |
|
|
|
1034 |
// Fill the dest field
|
|
|
1035 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
1036 |
p->ai.dst.use_tile = 0;
|
|
|
1037 |
p->ai.dst.rand_rng = 7;
|
|
|
1038 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
1039 |
p->ai.dst.unk6 = 1;
|
|
|
1040 |
p->ai.dst.unk7 = 0;
|
|
|
1041 |
p->ai.dst.buildcmd_a = 0xFF;
|
|
|
1042 |
p->ai.dst.buildcmd_b = 0xFF;
|
|
|
1043 |
p->ai.dst.direction = AiGetDirectionBetweenTiles(
|
|
|
1044 |
GET_TOWN_OR_INDUSTRY_TILE(fr.to),
|
|
|
1045 |
GET_TOWN_OR_INDUSTRY_TILE(fr.from)
|
|
|
1046 |
);
|
|
|
1047 |
p->ai.dst.cargo = fr.cargo;
|
|
|
1048 |
|
|
|
1049 |
// Fill common fields
|
|
|
1050 |
p->ai.cargo_type = fr.cargo;
|
|
|
1051 |
p->ai.num_wagons = 2;
|
|
|
1052 |
p->ai.build_kind = 1;
|
|
|
1053 |
p->ai.num_build_rec = 2;
|
|
|
1054 |
p->ai.num_loco_to_build = 1;
|
|
|
1055 |
p->ai.num_want_fullload = 0;
|
|
|
1056 |
p->ai.wagon_list[0] = INVALID_VEHICLE;
|
|
|
1057 |
p->ai.order_list_blocks[0] = 0;
|
|
|
1058 |
p->ai.order_list_blocks[1] = 1;
|
|
|
1059 |
p->ai.order_list_blocks[2] = 255;
|
|
|
1060 |
p->ai.state = AIS_BUILD_DEFAULT_RAIL_BLOCKS;
|
|
|
1061 |
p->ai.state_mode = -1;
|
|
|
1062 |
p->ai.state_counter = 0;
|
|
|
1063 |
p->ai.timeout_counter = 0;
|
|
|
1064 |
}
|
|
|
1065 |
|
|
|
1066 |
static void AiWantTrainRoute(Player *p)
|
|
|
1067 |
{
|
|
|
1068 |
uint16 r;
|
|
|
1069 |
p->ai.railtype_to_use = p->max_railtype - 1;
|
|
|
1070 |
r = (uint16)Random();
|
|
|
1071 |
|
|
|
1072 |
if (r > 0xD000) {
|
|
|
1073 |
AiWantLongIndustryRoute(p);
|
|
|
1074 |
} else if (r > 0x6000) {
|
|
|
1075 |
AiWantMediumIndustryRoute(p);
|
|
|
1076 |
} else if (r > 0x1000) {
|
|
|
1077 |
AiWantShortIndustryRoute(p);
|
|
|
1078 |
} else if (r > 0x800) {
|
|
|
1079 |
AiWantPassengerRoute(p);
|
|
|
1080 |
} else {
|
|
|
1081 |
AiWantMailRoute(p);
|
|
|
1082 |
}
|
|
|
1083 |
}
|
|
|
1084 |
|
|
|
1085 |
static void AiWantLongRoadIndustryRoute(Player *p)
|
|
|
1086 |
{
|
|
|
1087 |
int i;
|
|
|
1088 |
FoundRoute fr;
|
|
|
1089 |
|
|
|
1090 |
i = 60;
|
|
|
1091 |
for(;;) {
|
|
|
1092 |
|
|
|
1093 |
// look for one from the subsidy list
|
|
|
1094 |
AiFindSubsidyIndustryRoute(&fr);
|
|
|
1095 |
if (IS_INT_INSIDE(fr.distance, 35, 55+1))
|
|
|
1096 |
break;
|
|
|
1097 |
|
|
|
1098 |
// try a random one
|
|
|
1099 |
AiFindRandomIndustryRoute(&fr);
|
|
|
1100 |
if (IS_INT_INSIDE(fr.distance, 35, 55+1))
|
|
|
1101 |
break;
|
|
|
1102 |
|
|
|
1103 |
// only test 60 times
|
|
|
1104 |
if (--i == 0)
|
|
|
1105 |
return;
|
|
|
1106 |
}
|
|
|
1107 |
|
|
|
1108 |
if (!AiCheckIfRouteIsGood(p, &fr, 2))
|
|
|
1109 |
return;
|
|
|
1110 |
|
|
|
1111 |
// Fill the source field
|
|
|
1112 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
1113 |
p->ai.src.use_tile = 0;
|
|
|
1114 |
p->ai.src.rand_rng = 9;
|
|
|
1115 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
1116 |
p->ai.src.buildcmd_a = 1;
|
|
|
1117 |
p->ai.src.direction = 0;
|
|
|
1118 |
p->ai.src.cargo = fr.cargo | 0x80;
|
|
|
1119 |
|
|
|
1120 |
// Fill the dest field
|
|
|
1121 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
1122 |
p->ai.dst.use_tile = 0;
|
|
|
1123 |
p->ai.dst.rand_rng = 9;
|
|
|
1124 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
1125 |
p->ai.dst.buildcmd_a = 0xFF;
|
|
|
1126 |
p->ai.dst.direction = 0;
|
|
|
1127 |
p->ai.dst.cargo = fr.cargo;
|
|
|
1128 |
|
|
|
1129 |
// Fill common fields
|
|
|
1130 |
p->ai.cargo_type = fr.cargo;
|
|
|
1131 |
p->ai.num_build_rec = 2;
|
|
|
1132 |
p->ai.num_loco_to_build = 5;
|
|
|
1133 |
p->ai.num_want_fullload = 5;
|
|
|
1134 |
|
|
|
1135 |
// p->ai.loco_id = INVALID_VEHICLE;
|
|
|
1136 |
p->ai.order_list_blocks[0] = 0;
|
|
|
1137 |
p->ai.order_list_blocks[1] = 1;
|
|
|
1138 |
p->ai.order_list_blocks[2] = 255;
|
|
|
1139 |
|
|
|
1140 |
p->ai.state = AIS_BUILD_DEFAULT_ROAD_BLOCKS;
|
|
|
1141 |
p->ai.state_mode = -1;
|
|
|
1142 |
p->ai.state_counter = 0;
|
|
|
1143 |
p->ai.timeout_counter = 0;
|
|
|
1144 |
}
|
|
|
1145 |
|
|
|
1146 |
static void AiWantMediumRoadIndustryRoute(Player *p)
|
|
|
1147 |
{
|
|
|
1148 |
int i;
|
|
|
1149 |
FoundRoute fr;
|
|
|
1150 |
|
|
|
1151 |
i = 60;
|
|
|
1152 |
for(;;) {
|
|
|
1153 |
|
|
|
1154 |
// look for one from the subsidy list
|
|
|
1155 |
AiFindSubsidyIndustryRoute(&fr);
|
|
|
1156 |
if (IS_INT_INSIDE(fr.distance, 15, 40+1))
|
|
|
1157 |
break;
|
|
|
1158 |
|
|
|
1159 |
// try a random one
|
|
|
1160 |
AiFindRandomIndustryRoute(&fr);
|
|
|
1161 |
if (IS_INT_INSIDE(fr.distance, 15, 40+1))
|
|
|
1162 |
break;
|
|
|
1163 |
|
|
|
1164 |
// only test 60 times
|
|
|
1165 |
if (--i == 0)
|
|
|
1166 |
return;
|
|
|
1167 |
}
|
|
|
1168 |
|
|
|
1169 |
if (!AiCheckIfRouteIsGood(p, &fr, 2))
|
|
|
1170 |
return;
|
|
|
1171 |
|
|
|
1172 |
// Fill the source field
|
|
|
1173 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
1174 |
p->ai.src.use_tile = 0;
|
|
|
1175 |
p->ai.src.rand_rng = 9;
|
|
|
1176 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
1177 |
p->ai.src.buildcmd_a = 1;
|
|
|
1178 |
p->ai.src.direction = 0;
|
|
|
1179 |
p->ai.src.cargo = fr.cargo | 0x80;
|
|
|
1180 |
|
|
|
1181 |
// Fill the dest field
|
|
|
1182 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
1183 |
p->ai.dst.use_tile = 0;
|
|
|
1184 |
p->ai.dst.rand_rng = 9;
|
|
|
1185 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
1186 |
p->ai.dst.buildcmd_a = 0xFF;
|
|
|
1187 |
p->ai.dst.direction = 0;
|
|
|
1188 |
p->ai.dst.cargo = fr.cargo;
|
|
|
1189 |
|
|
|
1190 |
// Fill common fields
|
|
|
1191 |
p->ai.cargo_type = fr.cargo;
|
|
|
1192 |
p->ai.num_build_rec = 2;
|
|
|
1193 |
p->ai.num_loco_to_build = 3;
|
|
|
1194 |
p->ai.num_want_fullload = 3;
|
|
|
1195 |
|
|
|
1196 |
// p->ai.loco_id = INVALID_VEHICLE;
|
|
|
1197 |
p->ai.order_list_blocks[0] = 0;
|
|
|
1198 |
p->ai.order_list_blocks[1] = 1;
|
|
|
1199 |
p->ai.order_list_blocks[2] = 255;
|
|
|
1200 |
|
|
|
1201 |
p->ai.state = AIS_BUILD_DEFAULT_ROAD_BLOCKS;
|
|
|
1202 |
p->ai.state_mode = -1;
|
|
|
1203 |
p->ai.state_counter = 0;
|
|
|
1204 |
p->ai.timeout_counter = 0;
|
|
|
1205 |
}
|
|
|
1206 |
|
|
|
1207 |
static void AiWantLongRoadPassengerRoute(Player *p)
|
|
|
1208 |
{
|
|
|
1209 |
int i;
|
|
|
1210 |
FoundRoute fr;
|
|
|
1211 |
|
|
|
1212 |
i = 60;
|
|
|
1213 |
for(;;) {
|
|
|
1214 |
|
|
|
1215 |
// look for one from the subsidy list
|
|
|
1216 |
AiFindSubsidyPassengerRoute(&fr);
|
|
|
1217 |
if (IS_INT_INSIDE(fr.distance, 55, 180+1))
|
|
|
1218 |
break;
|
|
|
1219 |
|
|
|
1220 |
// try a random one
|
|
|
1221 |
AiFindRandomPassengerRoute(&fr);
|
|
|
1222 |
if (IS_INT_INSIDE(fr.distance, 55, 180+1))
|
|
|
1223 |
break;
|
|
|
1224 |
|
|
|
1225 |
// only test 60 times
|
|
|
1226 |
if (--i == 0)
|
|
|
1227 |
return;
|
|
|
1228 |
}
|
|
|
1229 |
|
|
|
1230 |
fr.cargo = CT_PASSENGERS;
|
|
|
1231 |
|
|
|
1232 |
if (!AiCheckIfRouteIsGood(p, &fr, 2))
|
|
|
1233 |
return;
|
|
|
1234 |
|
|
|
1235 |
// Fill the source field
|
|
|
1236 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
1237 |
p->ai.src.use_tile = 0;
|
|
|
1238 |
p->ai.src.rand_rng = 10;
|
|
|
1239 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
1240 |
p->ai.src.buildcmd_a = 1;
|
|
|
1241 |
p->ai.src.direction = 0;
|
|
|
1242 |
p->ai.src.cargo = CT_PASSENGERS;
|
|
|
1243 |
|
|
|
1244 |
// Fill the dest field
|
|
|
1245 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
1246 |
p->ai.dst.use_tile = 0;
|
|
|
1247 |
p->ai.dst.rand_rng = 10;
|
|
|
1248 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
1249 |
p->ai.dst.buildcmd_a = 0xFF;
|
|
|
1250 |
p->ai.dst.direction = 0;
|
|
|
1251 |
p->ai.dst.cargo = CT_PASSENGERS;
|
|
|
1252 |
|
|
|
1253 |
// Fill common fields
|
|
|
1254 |
p->ai.cargo_type = CT_PASSENGERS;
|
|
|
1255 |
p->ai.num_build_rec = 2;
|
|
|
1256 |
p->ai.num_loco_to_build = 4;
|
|
|
1257 |
p->ai.num_want_fullload = 0;
|
|
|
1258 |
|
|
|
1259 |
// p->ai.loco_id = INVALID_VEHICLE;
|
|
|
1260 |
p->ai.order_list_blocks[0] = 0;
|
|
|
1261 |
p->ai.order_list_blocks[1] = 1;
|
|
|
1262 |
p->ai.order_list_blocks[2] = 255;
|
|
|
1263 |
|
|
|
1264 |
p->ai.state = AIS_BUILD_DEFAULT_ROAD_BLOCKS;
|
|
|
1265 |
p->ai.state_mode = -1;
|
|
|
1266 |
p->ai.state_counter = 0;
|
|
|
1267 |
p->ai.timeout_counter = 0;
|
|
|
1268 |
}
|
|
|
1269 |
|
|
|
1270 |
static void AiWantPassengerRouteInsideTown(Player *p)
|
|
|
1271 |
{
|
|
|
1272 |
int i;
|
|
|
1273 |
FoundRoute fr;
|
|
|
1274 |
Town *t;
|
|
|
1275 |
|
|
|
1276 |
i = 60;
|
|
|
1277 |
for(;;) {
|
|
|
1278 |
// Find a town big enough
|
|
|
1279 |
t = AiFindRandomTown();
|
|
|
1280 |
if (t != NULL && t->population >= 700)
|
|
|
1281 |
break;
|
|
|
1282 |
|
|
|
1283 |
// only test 60 times
|
|
|
1284 |
if (--i == 0)
|
|
|
1285 |
return;
|
|
|
1286 |
}
|
|
|
1287 |
|
|
|
1288 |
fr.cargo = CT_PASSENGERS;
|
|
|
1289 |
fr.from = fr.to = t;
|
|
|
1290 |
|
|
|
1291 |
if (!AiCheckIfRouteIsGood(p, &fr, 2))
|
|
|
1292 |
return;
|
|
|
1293 |
|
|
|
1294 |
// Fill the source field
|
|
|
1295 |
p->ai.src.spec_tile = t->xy;
|
|
|
1296 |
p->ai.src.use_tile = 0;
|
|
|
1297 |
p->ai.src.rand_rng = 10;
|
|
|
1298 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
1299 |
p->ai.src.buildcmd_a = 1;
|
|
|
1300 |
p->ai.src.direction = 0;
|
|
|
1301 |
p->ai.src.cargo = CT_PASSENGERS;
|
|
|
1302 |
|
|
|
1303 |
// Fill the dest field
|
|
|
1304 |
p->ai.dst.spec_tile = t->xy;
|
|
|
1305 |
p->ai.dst.use_tile = 0;
|
|
|
1306 |
p->ai.dst.rand_rng = 10;
|
|
|
1307 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
1308 |
p->ai.dst.buildcmd_a = 0xFF;
|
|
|
1309 |
p->ai.dst.direction = 0;
|
|
|
1310 |
p->ai.dst.cargo = CT_PASSENGERS;
|
|
|
1311 |
|
|
|
1312 |
// Fill common fields
|
|
|
1313 |
p->ai.cargo_type = CT_PASSENGERS;
|
|
|
1314 |
p->ai.num_build_rec = 2;
|
|
|
1315 |
p->ai.num_loco_to_build = 2;
|
|
|
1316 |
p->ai.num_want_fullload = 0;
|
|
|
1317 |
|
|
|
1318 |
// p->ai.loco_id = INVALID_VEHICLE;
|
|
|
1319 |
p->ai.order_list_blocks[0] = 0;
|
|
|
1320 |
p->ai.order_list_blocks[1] = 1;
|
|
|
1321 |
p->ai.order_list_blocks[2] = 255;
|
|
|
1322 |
|
|
|
1323 |
p->ai.state = AIS_BUILD_DEFAULT_ROAD_BLOCKS;
|
|
|
1324 |
p->ai.state_mode = -1;
|
|
|
1325 |
p->ai.state_counter = 0;
|
|
|
1326 |
p->ai.timeout_counter = 0;
|
|
|
1327 |
}
|
|
|
1328 |
|
|
|
1329 |
static void AiWantRoadRoute(Player *p)
|
|
|
1330 |
{
|
|
|
1331 |
uint16 r = (uint16)Random();
|
|
|
1332 |
|
|
|
1333 |
if (r > 0x4000) {
|
|
|
1334 |
AiWantLongRoadIndustryRoute(p);
|
|
|
1335 |
} else if (r > 0x2000) {
|
|
|
1336 |
AiWantMediumRoadIndustryRoute(p);
|
|
|
1337 |
} else if (r > 0x1000) {
|
|
|
1338 |
AiWantLongRoadPassengerRoute(p);
|
|
|
1339 |
} else {
|
|
|
1340 |
AiWantPassengerRouteInsideTown(p);
|
|
|
1341 |
}
|
|
|
1342 |
|
|
|
1343 |
}
|
|
|
1344 |
|
|
|
1345 |
static void AiWantPassengerAircraftRoute(Player *p)
|
|
|
1346 |
{
|
|
|
1347 |
FoundRoute fr;
|
|
|
1348 |
int i;
|
|
|
1349 |
|
|
|
1350 |
i = 60;
|
|
|
1351 |
for(;;) {
|
|
|
1352 |
|
|
|
1353 |
// look for one from the subsidy list
|
|
|
1354 |
AiFindSubsidyPassengerRoute(&fr);
|
|
|
1355 |
if (IS_INT_INSIDE(fr.distance,0,95+1))
|
|
|
1356 |
break;
|
|
|
1357 |
|
|
|
1358 |
// try a random one
|
|
|
1359 |
AiFindRandomPassengerRoute(&fr);
|
|
|
1360 |
if (IS_INT_INSIDE(fr.distance,0,95+1))
|
|
|
1361 |
break;
|
|
|
1362 |
|
|
|
1363 |
// only test 60 times
|
|
|
1364 |
if (--i == 0)
|
|
|
1365 |
return;
|
|
|
1366 |
}
|
|
|
1367 |
|
|
|
1368 |
fr.cargo = CT_PASSENGERS;
|
|
|
1369 |
if (!AiCheckIfRouteIsGood(p, &fr, 4))
|
|
|
1370 |
return;
|
|
|
1371 |
|
|
|
1372 |
|
|
|
1373 |
// Fill the source field
|
|
|
1374 |
p->ai.src.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.to);
|
|
|
1375 |
p->ai.src.use_tile = 0;
|
|
|
1376 |
p->ai.src.rand_rng = 12;
|
|
|
1377 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
1378 |
p->ai.src.cargo = fr.cargo;
|
|
|
1379 |
|
|
|
1380 |
// Fill the dest field
|
|
|
1381 |
p->ai.dst.spec_tile = GET_TOWN_OR_INDUSTRY_TILE(fr.from);
|
|
|
1382 |
p->ai.dst.use_tile = 0;
|
|
|
1383 |
p->ai.dst.rand_rng = 12;
|
|
|
1384 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
1385 |
p->ai.dst.cargo = fr.cargo;
|
|
|
1386 |
|
|
|
1387 |
// Fill common fields
|
|
|
1388 |
p->ai.cargo_type = fr.cargo;
|
|
|
1389 |
p->ai.build_kind = 0;
|
|
|
1390 |
p->ai.num_build_rec = 2;
|
|
|
1391 |
p->ai.num_loco_to_build = 1;
|
|
|
1392 |
p->ai.num_want_fullload = 1;
|
|
|
1393 |
// p->ai.loco_id = INVALID_VEHICLE;
|
|
|
1394 |
p->ai.order_list_blocks[0] = 0;
|
|
|
1395 |
p->ai.order_list_blocks[1] = 1;
|
|
|
1396 |
p->ai.order_list_blocks[2] = 255;
|
|
|
1397 |
|
|
|
1398 |
p->ai.state = AIS_AIRPORT_STUFF;
|
|
|
1399 |
p->ai.timeout_counter = 0;
|
|
|
1400 |
}
|
|
|
1401 |
|
|
|
1402 |
static void AiWantOilRigAircraftRoute(Player *p)
|
|
|
1403 |
{
|
|
|
1404 |
int i;
|
|
|
1405 |
FoundRoute fr;
|
|
|
1406 |
Town *t;
|
|
|
1407 |
Industry *in;
|
|
|
1408 |
|
|
|
1409 |
i = 60;
|
|
|
1410 |
for(;;) {
|
|
|
1411 |
// Find a town
|
|
|
1412 |
t = AiFindRandomTown();
|
|
|
1413 |
if (t != NULL) {
|
|
|
1414 |
// Find a random oil rig industry
|
|
|
1415 |
in = DEREF_INDUSTRY(RandomRange(lengthof(_industries)));
|
|
|
1416 |
if (in != NULL && in->type == IT_OIL_RIG) {
|
|
|
1417 |
if (GetTileDist(t->xy, in->xy) < 60)
|
|
|
1418 |
break;
|
|
|
1419 |
}
|
|
|
1420 |
}
|
|
|
1421 |
|
|
|
1422 |
// only test 60 times
|
|
|
1423 |
if (--i == 0)
|
|
|
1424 |
return;
|
|
|
1425 |
}
|
|
|
1426 |
|
|
|
1427 |
fr.cargo = CT_PASSENGERS;
|
|
|
1428 |
fr.from = fr.to = t;
|
|
|
1429 |
|
|
|
1430 |
if (!AiCheckIfRouteIsGood(p, &fr, 4))
|
|
|
1431 |
return;
|
|
|
1432 |
|
|
|
1433 |
// Fill the source field
|
|
|
1434 |
p->ai.src.spec_tile = t->xy;
|
|
|
1435 |
p->ai.src.use_tile = 0;
|
|
|
1436 |
p->ai.src.rand_rng = 12;
|
|
|
1437 |
p->ai.src.cur_building_rule = 0xFF;
|
|
|
1438 |
p->ai.src.cargo = CT_PASSENGERS;
|
|
|
1439 |
|
|
|
1440 |
// Fill the dest field
|
|
|
1441 |
p->ai.dst.spec_tile = in->xy;
|
|
|
1442 |
p->ai.dst.use_tile = 0;
|
|
|
1443 |
p->ai.dst.rand_rng = 5;
|
|
|
1444 |
p->ai.dst.cur_building_rule = 0xFF;
|
|
|
1445 |
p->ai.dst.cargo = CT_PASSENGERS;
|
|
|
1446 |
|
|
|
1447 |
// Fill common fields
|
|
|
1448 |
p->ai.cargo_type = CT_PASSENGERS;
|
|
|
1449 |
p->ai.build_kind = 1;
|
|
|
1450 |
p->ai.num_build_rec = 2;
|
|
|
1451 |
p->ai.num_loco_to_build = 1;
|
|
|
1452 |
p->ai.num_want_fullload = 0;
|
|
|
1453 |
// p->ai.loco_id = INVALID_VEHICLE;
|
|
|
1454 |
p->ai.order_list_blocks[0] = 0;
|
|
|
1455 |
p->ai.order_list_blocks[1] = 1;
|
|
|
1456 |
p->ai.order_list_blocks[2] = 255;
|
|
|
1457 |
|
|
|
1458 |
p->ai.state = AIS_AIRPORT_STUFF;
|
|
|
1459 |
p->ai.timeout_counter = 0;
|
|
|
1460 |
}
|
|
|
1461 |
|
|
|
1462 |
static void AiWantAircraftRoute(Player *p)
|
|
|
1463 |
{
|
|
|
1464 |
uint16 r = (uint16)Random();
|
|
|
1465 |
|
|
|
1466 |
if (r >= 0x2AAA || _date < 0x3912) {
|
|
|
1467 |
AiWantPassengerAircraftRoute(p);
|
|
|
1468 |
} else {
|
|
|
1469 |
AiWantOilRigAircraftRoute(p);
|
|
|
1470 |
}
|
|
|
1471 |
}
|
|
|
1472 |
|
|
|
1473 |
static void AiWantShipRoute(Player *p)
|
|
|
1474 |
{
|
|
|
1475 |
// XXX
|
|
|
1476 |
// error("AiWaitShipRoute");
|
|
|
1477 |
}
|
|
|
1478 |
|
|
|
1479 |
|
|
|
1480 |
|
|
|
1481 |
static void AiStateWantNewRoute(Player *p)
|
|
|
1482 |
{
|
|
|
1483 |
uint16 r;
|
|
|
1484 |
int i;
|
|
|
1485 |
|
|
|
1486 |
if (p->player_money < AiGetBasePrice(p) * 500) {
|
|
|
1487 |
p->ai.state = AIS_0;
|
|
|
1488 |
return;
|
|
|
1489 |
}
|
|
|
1490 |
|
|
|
1491 |
i = 200;
|
|
|
1492 |
for(;;) {
|
|
|
1493 |
byte dis;
|
|
|
1494 |
|
|
|
1495 |
r = (uint16)Random();
|
|
|
1496 |
|
|
|
1497 |
dis = _patches.ai_disable_veh;
|
|
|
1498 |
if ((dis & 0xF) == 0xF) return; // no available vehicles at all?
|
|
|
1499 |
|
|
|
1500 |
if (r < 0x7626) {
|
|
|
1501 |
if (dis&DISABLE_TRAINS) continue;
|
|
|
1502 |
AiWantTrainRoute(p);
|
|
|
1503 |
} else if (r < 0xC4EA) {
|
|
|
1504 |
if (dis&DISABLE_ROADVEH) continue;
|
|
|
1505 |
AiWantRoadRoute(p);
|
|
|
1506 |
} else if (r < 0xD89B) {
|
|
|
1507 |
if (dis&DISABLE_AIRCRAFT) continue;
|
|
|
1508 |
AiWantAircraftRoute(p);
|
|
|
1509 |
} else {
|
|
|
1510 |
if (dis&DISABLE_SHIPS) continue;
|
|
|
1511 |
AiWantShipRoute(p);
|
|
|
1512 |
}
|
|
|
1513 |
|
|
|
1514 |
// got a route?
|
|
|
1515 |
if (p->ai.state != AIS_WANT_NEW_ROUTE)
|
|
|
1516 |
break;
|
|
|
1517 |
|
|
|
1518 |
// time out?
|
|
|
1519 |
if (--i == 0) {
|
|
|
1520 |
if (++p->ai.state_counter == 556) p->ai.state = AIS_0;
|
|
|
1521 |
break;
|
|
|
1522 |
}
|
|
|
1523 |
}
|
|
|
1524 |
}
|
|
|
1525 |
|
|
|
1526 |
static bool AiCheckTrackResources(TileIndex tile, const AiDefaultBlockData *p, byte cargo)
|
|
|
1527 |
{
|
|
|
1528 |
uint values[NUM_CARGO];
|
|
|
1529 |
int w,h;
|
|
|
1530 |
uint tile2;
|
|
|
1531 |
|
|
|
1532 |
for(;p->mode != 4;p++) if (p->mode == 1) {
|
|
|
1533 |
tile2 = TILE_ADD(tile, p->tileoffs);
|
|
|
1534 |
|
|
|
1535 |
w = ((p->attr>>1) & 7);
|
|
|
1536 |
h = ((p->attr>>4) & 7);
|
|
|
1537 |
if (p->attr&1) intswap(w, h);
|
|
|
1538 |
|
|
|
1539 |
if (cargo & 0x80) {
|
|
|
1540 |
GetProductionAroundTiles(values, tile2, w, h);
|
|
|
1541 |
return values[cargo & 0x7F] != 0;
|
|
|
1542 |
} else {
|
|
|
1543 |
GetAcceptanceAroundTiles(values, tile2, w, h);
|
|
|
1544 |
if (!(values[cargo] & ~7))
|
|
|
1545 |
return false;
|
|
|
1546 |
if (cargo != CT_MAIL)
|
|
|
1547 |
return true;
|
|
|
1548 |
return !!((values[cargo]>>1) & ~7);
|
|
|
1549 |
}
|
|
|
1550 |
}
|
|
|
1551 |
|
|
|
1552 |
return true;
|
|
|
1553 |
}
|
|
|
1554 |
|
|
|
1555 |
static int32 AiDoBuildDefaultRailTrack(TileIndex tile, const AiDefaultBlockData *p, byte flag)
|
|
|
1556 |
{
|
|
|
1557 |
int32 r;
|
|
|
1558 |
int32 total_cost = 0;
|
|
|
1559 |
Town *t = NULL;
|
|
|
1560 |
int rating = 0;
|
|
|
1561 |
int i,j,k;
|
|
|
1562 |
|
|
|
1563 |
for(;;) {
|
|
|
1564 |
// This will seldomly overflow for valid reasons. Mask it to be on the safe side.
|
|
|
1565 |
uint c = TILE_MASK(tile + p->tileoffs);
|
|
|
1566 |
|
|
|
1567 |
_cleared_town = NULL;
|
|
|
1568 |
|
|
|
1569 |
if (p->mode < 2) {
|
|
|
1570 |
if (p->mode == 0) {
|
|
|
1571 |
// Depot
|
|
|
1572 |
r = DoCommandByTile(c, _cur_ai_player->ai.railtype_to_use, p->attr, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_BUILD_TRAIN_DEPOT);
|
|
|
1573 |
} else {
|
|
|
1574 |
// Station
|
|
|
1575 |
r = DoCommandByTile(c, (p->attr&1) | (p->attr>>4)<<8 | (p->attr>>1&7)<<16, _cur_ai_player->ai.railtype_to_use, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_BUILD_RAILROAD_STATION);
|
|
|
1576 |
}
|
|
|
1577 |
|
|
|
1578 |
if (r == CMD_ERROR) return CMD_ERROR;
|
|
|
1579 |
total_cost += r;
|
|
|
1580 |
|
|
|
1581 |
clear_town_stuff:;
|
|
|
1582 |
if (_cleared_town != NULL) {
|
|
|
1583 |
if (t != NULL && t != _cleared_town)
|
|
|
1584 |
return CMD_ERROR;
|
|
|
1585 |
t = _cleared_town;
|
|
|
1586 |
rating += _cleared_town_rating;
|
|
|
1587 |
}
|
|
|
1588 |
} else if (p->mode == 2) {
|
|
|
1589 |
// Rail
|
|
|
1590 |
if (IS_TILETYPE(c, MP_RAILWAY))
|
|
|
1591 |
return CMD_ERROR;
|
|
|
1592 |
|
|
|
1593 |
j = p->attr;
|
|
|
1594 |
k = 0;
|
|
|
1595 |
|
|
|
1596 |
// Build the rail
|
|
|
1597 |
for(i=0; i!=6; i++,j>>=1) {
|
|
|
1598 |
if (j&1) {
|
|
|
1599 |
k = i;
|
|
|
1600 |
r = DoCommandByTile(c, _cur_ai_player->ai.railtype_to_use, i, flag | DC_AUTO | DC_NO_WATER, CMD_BUILD_SINGLE_RAIL);
|
|
|
1601 |
if (r == CMD_ERROR) return CMD_ERROR;
|
|
|
1602 |
total_cost += r;
|
|
|
1603 |
}
|
|
|
1604 |
}
|
|
|
1605 |
|
|
|
1606 |
/* signals too? */
|
|
|
1607 |
if (j&3) {
|
|
|
1608 |
// Can't build signals on a road.
|
|
|
1609 |
if (IS_TILETYPE(c, MP_STREET))
|
|
|
1610 |
return CMD_ERROR;
|
|
|
1611 |
|
|
|
1612 |
if (flag & DC_EXEC) {
|
|
|
1613 |
j = 4 - j;
|
|
|
1614 |
do {
|
|
|
1615 |
r = DoCommandByTile(c, k, 0, flag, CMD_BUILD_SIGNALS);
|
|
|
1616 |
} while (--j);
|
|
|
1617 |
} else {
|
|
|
1618 |
r = _price.build_signals;
|
|
|
1619 |
}
|
|
|
1620 |
if (r == CMD_ERROR) return CMD_ERROR;
|
|
|
1621 |
total_cost += r;
|
|
|
1622 |
}
|
|
|
1623 |
} else if (p->mode == 3) {
|
|
|
1624 |
//Clear stuff and then build single rail.
|
|
|
1625 |
if (GetTileSlope(c,NULL) != 0)
|
|
|
1626 |
return CMD_ERROR;
|
|
|
1627 |
r = DoCommandByTile(c, 0, 0, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_LANDSCAPE_CLEAR);
|
|
|
1628 |
if (r == CMD_ERROR) return CMD_ERROR;
|
|
|
1629 |
total_cost += r + _price.build_rail;
|
|
|
1630 |
|
|
|
1631 |
if (flag & DC_EXEC) {
|
|
|
1632 |
DoCommandByTile(c, _cur_ai_player->ai.railtype_to_use, p->attr&1, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_BUILD_SINGLE_RAIL);
|
|
|
1633 |
}
|
|
|
1634 |
|
|
|
1635 |
goto clear_town_stuff;
|
|
|
1636 |
} else {
|
|
|
1637 |
// Unk
|
|
|
1638 |
break;
|
|
|
1639 |
}
|
|
|
1640 |
|
|
|
1641 |
p++;
|
|
|
1642 |
}
|
|
|
1643 |
|
|
|
1644 |
if (!(flag & DC_EXEC)) {
|
|
|
1645 |
if (t != NULL && rating > t->ratings[_current_player]) {
|
|
|
1646 |
return CMD_ERROR;
|
|
|
1647 |
}
|
|
|
1648 |
}
|
|
|
1649 |
|
|
|
1650 |
return total_cost;
|
|
|
1651 |
}
|
|
|
1652 |
|
|
|
1653 |
// Returns rule and cost
|
|
|
1654 |
static int AiBuildDefaultRailTrack(TileIndex tile, byte p0, byte p1, byte p2, byte p3, byte dir, byte cargo, int32 *cost)
|
|
|
1655 |
{
|
|
|
1656 |
int i;
|
|
|
1657 |
const AiDefaultRailBlock *p;
|
|
|
1658 |
|
|
|
1659 |
for(i=0; (p = _default_rail_track_data[i]) != NULL; i++) {
|
|
|
1660 |
if (p->p0 == p0 && p->p1 == p1 && p->p2 == p2 && p->p3 == p3 &&
|
|
|
1661 |
(p->dir == 0xFF || p->dir == dir || ((p->dir-1)&3) == dir)) {
|
|
|
1662 |
*cost = AiDoBuildDefaultRailTrack(tile, p->data, DC_NO_TOWN_RATING);
|
|
|
1663 |
if (*cost != CMD_ERROR && AiCheckTrackResources(tile, p->data, cargo))
|
|
|
1664 |
return i;
|
|
|
1665 |
}
|
|
|
1666 |
}
|
|
|
1667 |
|
|
|
1668 |
return -1;
|
|
|
1669 |
}
|
|
|
1670 |
|
|
|
1671 |
static const byte _terraform_up_flags[] = {
|
|
|
1672 |
14, 13, 12, 11,
|
|
|
1673 |
10, 9, 8, 7,
|
|
|
1674 |
6, 5, 4, 3,
|
|
|
1675 |
2, 1, 0, 1,
|
|
|
1676 |
2, 1, 4, 1,
|
|
|
1677 |
2, 1, 8, 1,
|
|
|
1678 |
2, 1, 4, 2,
|
|
|
1679 |
2, 1
|
|
|
1680 |
};
|
|
|
1681 |
|
|
|
1682 |
static const byte _terraform_down_flags[] = {
|
|
|
1683 |
1, 2, 3, 4,
|
|
|
1684 |
5, 6, 1, 8,
|
|
|
1685 |
9, 10, 8, 12,
|
|
|
1686 |
4, 2, 0, 0,
|
|
|
1687 |
1, 2, 3, 4,
|
|
|
1688 |
5, 6, 2, 8,
|
|
|
1689 |
9, 10, 1, 12,
|
|
|
1690 |
8, 4
|
|
|
1691 |
};
|
|
|
1692 |
|
|
|
1693 |
static void AiDoTerraformLand(TileIndex tile, int dir, int unk, int mode)
|
|
|
1694 |
{
|
|
|
1695 |
byte old_player;
|
|
|
1696 |
uint32 r;
|
|
|
1697 |
uint slope;
|
|
|
1698 |
int h;
|
|
|
1699 |
|
|
|
1700 |
old_player = _current_player;
|
|
|
1701 |
_current_player = OWNER_NONE;
|
|
|
1702 |
|
|
|
1703 |
r = Random();
|
|
|
1704 |
|
|
|
1705 |
unk &= (int)r;
|
|
|
1706 |
|
|
|
1707 |
do {
|
|
|
1708 |
tile = TILE_MASK(tile + _tileoffs_by_dir[dir]);
|
|
|
1709 |
|
|
|
1710 |
r >>= 2;
|
|
|
1711 |
if (r&2) {
|
|
|
1712 |
dir++;
|
|
|
1713 |
if (r&1)
|
|
|
1714 |
dir -= 2;
|
|
|
1715 |
}
|
|
|
1716 |
dir &= 3;
|
|
|
1717 |
} while (--unk >= 0);
|
|
|
1718 |
|
|
|
1719 |
slope = GetTileSlope(tile, &h);
|
|
|
1720 |
|
|
|
1721 |
if (slope != 0) {
|
|
|
1722 |
if (mode > 0 || (mode == 0 && !(r&0xC))) {
|
|
|
1723 |
// Terraform up
|
|
|
1724 |
DoCommandByTile(tile, _terraform_up_flags[slope-1], 1,
|
|
|
1725 |
DC_EXEC | DC_AUTO | DC_NO_WATER, CMD_TERRAFORM_LAND);
|
|
|
1726 |
} else if (h != 0) {
|
|
|
1727 |
// Terraform down
|
|
|
1728 |
DoCommandByTile(tile, _terraform_down_flags[slope-1], 0,
|
|
|
1729 |
DC_EXEC | DC_AUTO | DC_NO_WATER, CMD_TERRAFORM_LAND);
|
|
|
1730 |
}
|
|
|
1731 |
}
|
|
|
1732 |
|
|
|
1733 |
_current_player = old_player;
|
|
|
1734 |
}
|
|
|
1735 |
|
|
|
1736 |
static void AiStateBuildDefaultRailBlocks(Player *p)
|
|
|
1737 |
{
|
|
|
1738 |
int i, j;
|
|
|
1739 |
AiBuildRec *aib;
|
|
|
1740 |
int rule;
|
|
|
1741 |
int32 cost;
|
|
|
1742 |
|
|
|
1743 |
// time out?
|
|
|
1744 |
if (++p->ai.timeout_counter == 1388) {
|
|
|
1745 |
p->ai.state = AIS_DELETE_RAIL_BLOCKS;
|
|
|
1746 |
return;
|
|
|
1747 |
}
|
|
|
1748 |
|
|
|
1749 |
// do the following 8 times
|
|
|
1750 |
i = 8;
|
|
|
1751 |
do {
|
|
|
1752 |
// check if we can build the default track
|
|
|
1753 |
aib = &p->ai.src;
|
|
|
1754 |
j = p->ai.num_build_rec;
|
|
|
1755 |
do {
|
|
|
1756 |
// this item has already been built?
|
|
|
1757 |
if (aib->cur_building_rule != 255)
|
|
|
1758 |
continue;
|
|
|
1759 |
|
|
|
1760 |
// adjust the coordinate randomly,
|
|
|
1761 |
// to make sure that we find a position.
|
|
|
1762 |
aib->use_tile = AdjustTileCoordRandomly(aib->spec_tile, aib->rand_rng);
|
|
|
1763 |
|
|
|
1764 |
// check if the track can be build there.
|
|
|
1765 |
rule = AiBuildDefaultRailTrack(aib->use_tile,
|
|
|
1766 |
p->ai.build_kind, p->ai.num_wagons,
|
|
|
1767 |
aib->unk6, aib->unk7,
|
|
|
1768 |
aib->direction, aib->cargo, &cost);
|
|
|
1769 |
|
|
|
1770 |
if (rule == -1) {
|
|
|
1771 |
// cannot build, terraform after a while
|
|
|
1772 |
if (p->ai.state_counter >= 600) {
|
|
|
1773 |
AiDoTerraformLand(aib->use_tile, Random()&3, 3, (int8)p->ai.state_mode);
|
|
|
1774 |
}
|
|
|
1775 |
// also try the other terraform direction
|
|
|
1776 |
if (++p->ai.state_counter >= 1000) {
|
|
|
1777 |
p->ai.state_counter = 0;
|
|
|
1778 |
p->ai.state_mode = -p->ai.state_mode;
|
|
|
1779 |
}
|
|
|
1780 |
} else if (CheckPlayerHasMoney(cost)) {
|
|
|
1781 |
int32 r;
|
|
|
1782 |
// player has money, build it.
|
|
|
1783 |
aib->cur_building_rule = rule;
|
|
|
1784 |
|
|
|
1785 |
r = AiDoBuildDefaultRailTrack(
|
|
|
1786 |
aib->use_tile,
|
|
|
1787 |
_default_rail_track_data[rule]->data,
|
|
|
1788 |
DC_EXEC | DC_NO_TOWN_RATING
|
|
|
1789 |
);
|
|
|
1790 |
assert(r != CMD_ERROR);
|
|
|
1791 |
}
|
|
|
1792 |
} while (++aib,--j);
|
|
|
1793 |
} while (--i);
|
|
|
1794 |
|
|
|
1795 |
// check if we're done with all of them
|
|
|
1796 |
aib = &p->ai.src;
|
|
|
1797 |
j = p->ai.num_build_rec;
|
|
|
1798 |
do {
|
|
|
1799 |
if (aib->cur_building_rule == 255)
|
|
|
1800 |
return;
|
|
|
1801 |
} while (++aib,--j);
|
|
|
1802 |
|
|
|
1803 |
// yep, all are done. switch state to the rail building state.
|
|
|
1804 |
p->ai.state = AIS_BUILD_RAIL;
|
|
|
1805 |
p->ai.state_mode = 255;
|
|
|
1806 |
}
|
|
|
1807 |
|
|
|
1808 |
static TileIndex AiGetEdgeOfDefaultRailBlock(byte rule, TileIndex tile, byte cmd, int *dir)
|
|
|
1809 |
{
|
|
|
1810 |
const AiDefaultBlockData *p = _default_rail_track_data[rule]->data;
|
|
|
1811 |
|
|
|
1812 |
while (p->mode != 3 || !((--cmd) & 0x80)) p++;
|
|
|
1813 |
|
|
|
1814 |
return tile + p->tileoffs - _tileoffs_by_dir[*dir = p->attr];
|
|
|
1815 |
}
|
|
|
1816 |
|
|
|
1817 |
typedef struct AiRailPathFindData {
|
|
|
1818 |
TileIndex tile;
|
|
|
1819 |
TileIndex tile2;
|
|
|
1820 |
int count;
|
|
|
1821 |
bool flag;
|
|
|
1822 |
} AiRailPathFindData;
|
|
|
1823 |
|
|
|
1824 |
static bool AiEnumFollowTrack(uint tile, AiRailPathFindData *a, int track, uint length, byte *state)
|
|
|
1825 |
{
|
|
|
1826 |
if (a->flag)
|
|
|
1827 |
return true;
|
|
|
1828 |
|
|
|
1829 |
if (length > 20 || tile == a->tile) {
|
|
|
1830 |
a->flag = true;
|
|
|
1831 |
return true;
|
|
|
1832 |
}
|
|
|
1833 |
|
|
|
1834 |
if (GetTileDist1D(tile, a->tile2) < 4)
|
|
|
1835 |
a->count++;
|
|
|
1836 |
|
|
|
1837 |
return false;
|
|
|
1838 |
}
|
|
|
1839 |
|
|
|
1840 |
static bool AiDoFollowTrack(Player *p)
|
|
|
1841 |
{
|
|
|
1842 |
AiRailPathFindData arpfd;
|
|
|
1843 |
arpfd.tile = p->ai.start_tile_a;
|
|
|
1844 |
arpfd.tile2 = p->ai.cur_tile_a;
|
|
|
1845 |
arpfd.flag = false;
|
|
|
1846 |
arpfd.count = 0;
|
|
|
1847 |
FollowTrack(p->ai.cur_tile_a + _tileoffs_by_dir[p->ai.cur_dir_a], 0x2000, p->ai.cur_dir_a^2,
|
|
|
1848 |
(TPFEnumProc*)AiEnumFollowTrack, NULL, &arpfd);
|
|
|
1849 |
return arpfd.count > 8;
|
|
|
1850 |
}
|
|
|
1851 |
|
|
|
1852 |
typedef struct AiRailFinder {
|
|
|
1853 |
TileIndex final_tile;
|
|
|
1854 |
byte final_dir;
|
|
|
1855 |
byte depth;
|
|
|
1856 |
byte recursive_mode;
|
|
|
1857 |
byte cur_best_dir;
|
|
|
1858 |
byte best_dir;
|
|
|
1859 |
byte cur_best_depth;
|
|
|
1860 |
byte best_depth;
|
|
|
1861 |
uint cur_best_dist;
|
|
|
1862 |
const byte *best_ptr;
|
|
|
1863 |
uint best_dist;
|
|
|
1864 |
TileIndex cur_best_tile, best_tile;
|
|
|
1865 |
TileIndex bridge_end_tile;
|
|
|
1866 |
Player *player;
|
|
|
1867 |
TileInfo ti;
|
|
|
1868 |
} AiRailFinder;
|
|
|
1869 |
|
|
|
1870 |
static const byte _ai_table_15[4][8] = {
|
|
|
1871 |
{0, 0, 4, 3, 3, 1, 128+0, 64},
|
|
|
1872 |
{1, 1, 2, 0, 4, 2, 128+1, 65},
|
|
|
1873 |
{0, 2, 2, 3, 5, 1, 128+2, 66},
|
|
|
1874 |
{1, 3, 5, 0, 3, 2, 128+3, 67}
|
|
|
1875 |
};
|
|
|
1876 |
|
|
|
1877 |
static const byte _dir_table_1[] = {3, 9, 12, 6};
|
|
|
1878 |
static const byte _dir_table_2[] = {12, 6, 3, 9};
|
|
|
1879 |
|
|
|
1880 |
|
|
|
1881 |
static bool AiIsTileBanned(Player *p, TileIndex tile, byte val) {
|
|
|
1882 |
int i;
|
|
|
1883 |
|
|
|
1884 |
for(i=0; i!=p->ai.banned_tile_count; i++)
|
|
|
1885 |
if (p->ai.banned_tiles[i] == tile &&
|
|
|
1886 |
p->ai.banned_val[i] == val)
|
|
|
1887 |
return true;
|
|
|
1888 |
return false;
|
|
|
1889 |
}
|
|
|
1890 |
|
|
|
1891 |
static void AiBanTile(Player *p, TileIndex tile, byte val) {
|
|
|
1892 |
int i;
|
|
|
1893 |
|
|
|
1894 |
for(i=lengthof(p->ai.banned_tiles)-1; i!=0; i--) {
|
|
|
1895 |
p->ai.banned_tiles[i] = p->ai.banned_tiles[i-1];
|
|
|
1896 |
p->ai.banned_val[i] = p->ai.banned_val[i-1];
|
|
|
1897 |
}
|
|
|
1898 |
|
|
|
1899 |
p->ai.banned_tiles[0] = tile;
|
|
|
1900 |
p->ai.banned_val[0] = val;
|
|
|
1901 |
|
|
|
1902 |
if (p->ai.banned_tile_count != lengthof(p->ai.banned_tiles))
|
|
|
1903 |
p->ai.banned_tile_count++;
|
|
|
1904 |
}
|
|
|
1905 |
|
|
|
1906 |
static void AiBuildRailRecursive(AiRailFinder *arf, TileIndex tile, int dir);
|
|
|
1907 |
|
|
|
1908 |
static bool AiCheckRailPathBetter(AiRailFinder *arf, const byte *p)
|
|
|
1909 |
{
|
|
|
1910 |
bool better = false;
|
|
|
1911 |
|
|
|
1912 |
if (arf->recursive_mode < 1) {
|
|
|
1913 |
// Mode is 0. This means destination has not been found yet.
|
|
|
1914 |
// If the found path is shorter than the current one, remember it.
|
|
|
1915 |
if (arf->cur_best_dist < arf->best_dist) {
|
|
|
1916 |
arf->best_dir = arf->cur_best_dir;
|
|
|
1917 |
arf->best_dist = arf->cur_best_dist;
|
|
|
1918 |
arf->best_ptr = p;
|
|
|
1919 |
arf->best_tile = arf->cur_best_tile;
|
|
|
1920 |
better = true;
|
|
|
1921 |
}
|
|
|
1922 |
} else if (arf->recursive_mode > 1) {
|
|
|
1923 |
// Mode is 2.
|
|
|
1924 |
if (arf->best_dist != 0 || arf->cur_best_depth < arf->best_depth) {
|
|
|
1925 |
arf->best_depth = arf->cur_best_depth;
|
|
|
1926 |
arf->best_dist = 0;
|
|
|
1927 |
arf->best_ptr = p;
|
|
|
1928 |
arf->best_tile = 0;
|
|
|
1929 |
better = true;
|
|
|
1930 |
}
|
|
|
1931 |
}
|
|
|
1932 |
arf->recursive_mode = 0;
|
|
|
1933 |
arf->cur_best_dist = (uint)-1;
|
|
|
1934 |
arf->cur_best_depth = 0xff;
|
|
|
1935 |
|
|
|
1936 |
return better;
|
|
|
1937 |
}
|
|
|
1938 |
|
|
|
1939 |
static void FORCEINLINE AiCheckBuildRailBridgeHere(AiRailFinder *arf, TileIndex tile, const byte *p)
|
|
|
1940 |
{
|
|
|
1941 |
TileIndex tile_new;
|
|
|
1942 |
bool flag;
|
|
|
1943 |
|
|
|
1944 |
int dir2 = p[0] & 3;
|
|
|
1945 |
|
|
|
1946 |
FindLandscapeHeightByTile(&arf->ti, tile);
|
|
|
1947 |
|
|
|
1948 |
if (arf->ti.tileh == _dir_table_1[dir2] || (arf->ti.tileh==0 && arf->ti.z!=0)) {
|
|
|
1949 |
tile_new = tile;
|
|
|
1950 |
// Allow bridges directly over bottom tiles
|
|
|
1951 |
flag = arf->ti.z == 0;
|
|
|
1952 |
for(;;) {
|
|
|
1953 |
if (tile_new < -_tileoffs_by_dir[dir2]) return; // Wraping around map, no bridge possible!
|
|
|
1954 |
tile_new = TILE_MASK(tile_new + _tileoffs_by_dir[dir2]);
|
|
|
1955 |
FindLandscapeHeightByTile(&arf->ti, tile_new);
|
|
|
1956 |
if (arf->ti.tileh != 0 || arf->ti.type == MP_CLEAR || arf->ti.type == MP_TREES) {
|
|
|
1957 |
if (!flag) return;
|
|
|
1958 |
break;
|
|
|
1959 |
}
|
|
|
1960 |
if (arf->ti.type != MP_WATER && arf->ti.type != MP_RAILWAY && arf->ti.type != MP_STREET)
|
|
|
1961 |
return;
|
|
|
1962 |
flag = true;
|
|
|
1963 |
}
|
|
|
1964 |
|
|
|
1965 |
// Is building a (rail)bridge possible at this place (type doesn't matter)?
|
|
|
1966 |
if (DoCommandByTile(tile_new, tile, arf->player->ai.railtype_to_use<<8,
|
|
|
1967 |
DC_AUTO, CMD_BUILD_BRIDGE) == CMD_ERROR)
|
|
|
1968 |
return;
|
|
|
1969 |
AiBuildRailRecursive(arf, tile_new, dir2);
|
|
|
1970 |
|
|
|
1971 |
// At the bottom depth, check if the new path is better than the old one.
|
|
|
1972 |
if (arf->depth == 1) {
|
|
|
1973 |
if (AiCheckRailPathBetter(arf, p))
|
|
|
1974 |
arf->bridge_end_tile = tile_new;
|
|
|
1975 |
}
|
|
|
1976 |
}
|
|
|
1977 |
}
|
|
|
1978 |
|
|
|
1979 |
static void FORCEINLINE AiCheckBuildRailTunnelHere(AiRailFinder *arf, TileIndex tile, const byte *p)
|
|
|
1980 |
{
|
|
|
1981 |
FindLandscapeHeightByTile(&arf->ti, tile);
|
|
|
1982 |
|
|
|
1983 |
if (arf->ti.tileh == _dir_table_2[p[0]&3] && arf->ti.z!=0) {
|
|
|
1984 |
int32 cost = DoCommandByTile(tile, arf->player->ai.railtype_to_use, 0, DC_AUTO, CMD_BUILD_TUNNEL);
|
|
|
1985 |
|
|
|
1986 |
if (cost != CMD_ERROR && cost <= (arf->player->player_money>>4)) {
|
|
|
1987 |
AiBuildRailRecursive(arf, _build_tunnel_endtile, p[0]&3);
|
|
|
1988 |
if (arf->depth == 1) {
|
|
|
1989 |
AiCheckRailPathBetter(arf, p);
|
|
|
1990 |
}
|
|
|
1991 |
}
|
|
|
1992 |
}
|
|
|
1993 |
}
|
|
|
1994 |
|
|
|
1995 |
|
|
|
1996 |
static void AiBuildRailRecursive(AiRailFinder *arf, TileIndex tile, int dir)
|
|
|
1997 |
{
|
|
|
1998 |
const byte *p;
|
|
|
1999 |
|
|
|
2000 |
tile = TILE_MASK(tile + _tileoffs_by_dir[dir]);
|
|
|
2001 |
|
|
|
2002 |
// Reached destination?
|
|
|
2003 |
if (tile == arf->final_tile) {
|
|
|
2004 |
if (arf->final_dir != (dir^2)) {
|
|
|
2005 |
if (arf->recursive_mode != 2)
|
|
|
2006 |
arf->recursive_mode = 1;
|
|
|
2007 |
} else if (arf->recursive_mode != 2) {
|
|
|
2008 |
arf->recursive_mode = 2;
|
|
|
2009 |
arf->cur_best_depth = arf->depth;
|
|
|
2010 |
} else {
|
|
|
2011 |
if (arf->depth < arf->cur_best_depth)
|
|
|
2012 |
arf->cur_best_depth = arf->depth;
|
|
|
2013 |
}
|
|
|
2014 |
return;
|
|
|
2015 |
}
|
|
|
2016 |
|
|
|
2017 |
// Depth too deep?
|
|
|
2018 |
if (arf->depth >= 4) {
|
|
|
2019 |
uint dist = GetTileDist1Db(tile, arf->final_tile);
|
|
|
2020 |
if (dist < arf->cur_best_dist) {
|
|
|
2021 |
// Store the tile that is closest to the final position.
|
|
|
2022 |
arf->cur_best_depth = arf->depth;
|
|
|
2023 |
arf->cur_best_dist = dist;
|
|
|
2024 |
arf->cur_best_tile = tile;
|
|
|
2025 |
arf->cur_best_dir = dir;
|
|
|
2026 |
}
|
|
|
2027 |
return;
|
|
|
2028 |
}
|
|
|
2029 |
|
|
|
2030 |
// Increase recursion depth
|
|
|
2031 |
arf->depth++;
|
|
|
2032 |
|
|
|
2033 |
// Grab pointer to list of stuff that is possible to build
|
|
|
2034 |
p = _ai_table_15[dir];
|
|
|
2035 |
|
|
|
2036 |
// Try to build a single rail in all directions.
|
|
|
2037 |
FindLandscapeHeightByTile(&arf->ti, tile);
|
|
|
2038 |
if (arf->ti.z == 0) {
|
|
|
2039 |
p += 6;
|
|
|
2040 |
} else {
|
|
|
2041 |
do {
|
|
|
2042 |
// Make sure the tile is not in the list of banned tiles and that a rail can be built here.
|
|
|
2043 |
if (!AiIsTileBanned(arf->player, tile, p[0]) &&
|
|
|
2044 |
DoCommandByTile(tile, arf->player->ai.railtype_to_use, p[0], DC_AUTO | DC_NO_WATER | DC_NO_RAIL_OVERLAP, CMD_BUILD_SINGLE_RAIL) != CMD_ERROR) {
|
|
|
2045 |
AiBuildRailRecursive(arf, tile, p[1]);
|
|
|
2046 |
}
|
|
|
2047 |
|
|
|
2048 |
// At the bottom depth?
|
|
|
2049 |
if (arf->depth == 1) {
|
|
|
2050 |
AiCheckRailPathBetter(arf, p);
|
|
|
2051 |
}
|
|
|
2052 |
|
|
|
2053 |
p += 2;
|
|
|
2054 |
} while (!(p[0]&0x80));
|
|
|
2055 |
}
|
|
|
2056 |
|
|
|
2057 |
AiCheckBuildRailBridgeHere(arf, tile, p);
|
|
|
2058 |
AiCheckBuildRailTunnelHere(arf, tile, p+1);
|
|
|
2059 |
|
|
|
2060 |
arf->depth--;
|
|
|
2061 |
}
|
|
|
2062 |
|
|
|
2063 |
|
|
|
2064 |
static const byte _dir_table_3[]= {0x25, 0x2A, 0x19, 0x16};
|
|
|
2065 |
|
|
|
2066 |
static void AiBuildRailConstruct(Player *p)
|
|
|
2067 |
{
|
|
|
2068 |
AiRailFinder arf;
|
|
|
2069 |
int i;
|
|
|
2070 |
|
|
|
2071 |
// Check too much lookahead?
|
|
|
2072 |
if (AiDoFollowTrack(p)) {
|
|
|
2073 |
p->ai.state_counter = (Random()&0xE)+6; // Destruct this amount of blocks
|
|
|
2074 |
p->ai.state_mode = 1; // Start destruct
|
|
|
2075 |
|
|
|
2076 |
// Ban this tile and don't reach it for a while.
|
|
|
2077 |
AiBanTile(p, p->ai.cur_tile_a, FindFirstBit(GetRailTrackStatus(p->ai.cur_tile_a)));
|
|
|
2078 |
return;
|
|
|
2079 |
}
|
|
|
2080 |
|
|
|
2081 |
// Setup recursive finder and call it.
|
|
|
2082 |
arf.player = p;
|
|
|
2083 |
arf.final_tile = p->ai.cur_tile_b;
|
|
|
2084 |
arf.final_dir = p->ai.cur_dir_b;
|
|
|
2085 |
arf.depth = 0;
|
|
|
2086 |
arf.recursive_mode = 0;
|
|
|
2087 |
arf.best_ptr = NULL;
|
|
|
2088 |
arf.cur_best_dist = (uint)-1;
|
|
|
2089 |
arf.cur_best_depth = 0xff;
|
|
|
2090 |
arf.best_dist = (uint)-1;
|
|
|
2091 |
arf.best_depth = 0xff;
|
|
|
2092 |
arf.cur_best_tile = 0;
|
|
|
2093 |
arf.best_tile = 0;
|
|
|
2094 |
AiBuildRailRecursive(&arf, p->ai.cur_tile_a, p->ai.cur_dir_a);
|
|
|
2095 |
|
|
|
2096 |
// Reached destination?
|
|
|
2097 |
if (arf.recursive_mode == 2 && arf.cur_best_depth == 0) {
|
|
|
2098 |
p->ai.state_mode = 255;
|
|
|
2099 |
return;
|
|
|
2100 |
}
|
|
|
2101 |
|
|
|
2102 |
// Didn't find anything to build?
|
|
|
2103 |
if (arf.best_ptr == NULL) {
|
|
|
2104 |
// Terraform some
|
|
|
2105 |
for(i=0; i!=5; i++)
|
|
|
2106 |
AiDoTerraformLand(p->ai.cur_tile_a, p->ai.cur_dir_a, 3, 0);
|
|
|
2107 |
|
|
|
2108 |
if (++p->ai.state_counter == 21) {
|
|
|
2109 |
p->ai.state_counter = 40;
|
|
|
2110 |
p->ai.state_mode = 1;
|
|
|
2111 |
|
|
|
2112 |
// Ban this tile
|
|
|
2113 |
AiBanTile(p, p->ai.cur_tile_a, FindFirstBit(GetRailTrackStatus(p->ai.cur_tile_a)));
|
|
|
2114 |
}
|
|
|
2115 |
return;
|
|
|
2116 |
}
|
|
|
2117 |
|
|
|
2118 |
p->ai.cur_tile_a += _tileoffs_by_dir[p->ai.cur_dir_a];
|
|
|
2119 |
|
|
|
2120 |
if (arf.best_ptr[0]&0x80) {
|
|
|
2121 |
int i;
|
|
|
2122 |
int32 bridge_len = GetBridgeLength(arf.bridge_end_tile, p->ai.cur_tile_a);
|
|
|
2123 |
|
|
|
2124 |
/* Figure out what (rail)bridge type to build
|
|
|
2125 |
start with best bridge, then go down to worse and worse bridges
|
|
|
2126 |
unnecessary to check for worse bridge (i=0), since AI will always build that.
|
|
|
2127 |
AI is so fucked up that fixing this small thing will probably not solve a thing
|
|
|
2128 |
*/
|
|
|
2129 |
for(i = 10 + (p->ai.railtype_to_use << 8); i != 0; i--) {
|
|
|
2130 |
if (CheckBridge_Stuff(i, bridge_len)) {
|
|
|
2131 |
int32 cost = DoCommandByTile(arf.bridge_end_tile, p->ai.cur_tile_a, i, DC_AUTO, CMD_BUILD_BRIDGE);
|
|
|
2132 |
if (cost != CMD_ERROR && cost < (p->player_money >> 5))
|
|
|
2133 |
break;
|
|
|
2134 |
}
|
|
|
2135 |
}
|
|
|
2136 |
|
|
|
2137 |
// Build it
|
|
|
2138 |
DoCommandByTile(arf.bridge_end_tile, p->ai.cur_tile_a, i, DC_AUTO | DC_EXEC, CMD_BUILD_BRIDGE);
|
|
|
2139 |
|
|
|
2140 |
p->ai.cur_tile_a = arf.bridge_end_tile;
|
|
|
2141 |
p->ai.state_counter = 0;
|
|
|
2142 |
} else if (arf.best_ptr[0]&0x40) {
|
|
|
2143 |
// tunnel
|
|
|
2144 |
DoCommandByTile(p->ai.cur_tile_a, p->ai.railtype_to_use, 0, DC_AUTO | DC_EXEC, CMD_BUILD_TUNNEL);
|
|
|
2145 |
p->ai.cur_tile_a = _build_tunnel_endtile;
|
|
|
2146 |
p->ai.state_counter = 0;
|
|
|
2147 |
} else {
|
|
|
2148 |
// rail
|
|
|
2149 |
p->ai.cur_dir_a = arf.best_ptr[1];
|
|
|
2150 |
DoCommandByTile(p->ai.cur_tile_a, p->ai.railtype_to_use, arf.best_ptr[0],
|
|
|
2151 |
DC_EXEC | DC_AUTO | DC_NO_WATER | DC_NO_RAIL_OVERLAP, CMD_BUILD_SINGLE_RAIL);
|
|
|
2152 |
p->ai.state_counter = 0;
|
|
|
2153 |
}
|
|
|
2154 |
|
|
|
2155 |
if (arf.best_tile != 0) {
|
|
|
2156 |
for(i=0; i!=2; i++)
|
|
|
2157 |
AiDoTerraformLand(arf.best_tile, arf.best_dir, 3, 0);
|
|
|
2158 |
}
|
|
|
2159 |
}
|
|
|
2160 |
|
|
|
2161 |
static bool AiRemoveTileAndGoForward(Player *p)
|
|
|
2162 |
{
|
|
|
2163 |
byte b;
|
|
|
2164 |
int bit;
|
|
|
2165 |
const byte *ptr;
|
|
|
2166 |
uint tile = p->ai.cur_tile_a;
|
|
|
2167 |
int offs;
|
|
|
2168 |
TileIndex tilenew;
|
|
|
2169 |
|
|
|
2170 |
if (IS_TILETYPE(tile, MP_TUNNELBRIDGE)) {
|
|
|
2171 |
if (!(_map5[tile] & 0x80)) {
|
|
|
2172 |
// Clear the tunnel and continue at the other side of it.
|
|
|
2173 |
if (DoCommandByTile(tile, 0, 0, DC_EXEC, CMD_LANDSCAPE_CLEAR) == CMD_ERROR)
|
|
|
2174 |
return false;
|
|
|
2175 |
p->ai.cur_tile_a = TILE_MASK(_build_tunnel_endtile - _tileoffs_by_dir[p->ai.cur_dir_a]);
|
|
|
2176 |
return true;
|
|
|
2177 |
}
|
|
|
2178 |
|
|
|
2179 |
if (!(_map5[tile] & 0x40)) {
|
|
|
2180 |
|
|
|
2181 |
// Check if the bridge points in the right direction.
|
|
|
2182 |
// This is not really needed the first place AiRemoveTileAndGoForward is called.
|
|
|
2183 |
if ((_map5[tile]&1) != (p->ai.cur_dir_a&1))
|
|
|
2184 |
return false;
|
|
|
2185 |
|
|
|
2186 |
// Find other side of bridge.
|
|
|
2187 |
offs = _tileoffs_by_dir[p->ai.cur_dir_a];
|
|
|
2188 |
do {
|
|
|
2189 |
tile = TILE_MASK(tile - offs);
|
|
|
2190 |
} while (_map5[tile] & 0x40);
|
|
|
2191 |
|
|
|
2192 |
tilenew = TILE_MASK(tile - offs);
|
|
|
2193 |
// And clear the bridge.
|
|
|
2194 |
if (DoCommandByTile(tile, 0, 0, DC_EXEC, CMD_LANDSCAPE_CLEAR) == CMD_ERROR)
|
|
|
2195 |
return false;
|
|
|
2196 |
p->ai.cur_tile_a = tilenew;
|
|
|
2197 |
return true;
|
|
|
2198 |
}
|
|
|
2199 |
}
|
|
|
2200 |
|
|
|
2201 |
// Find the railtype at the position. Quit if no rail there.
|
|
|
2202 |
b = GetRailTrackStatus(tile) & _dir_table_3[p->ai.cur_dir_a];
|
|
|
2203 |
if (b == 0)
|
|
|
2204 |
return false;
|
|
|
2205 |
|
|
|
2206 |
// Convert into a bit position that CMD_REMOVE_SINGLE_RAIL expects.
|
|
|
2207 |
bit = FindFirstBit(b);
|
|
|
2208 |
|
|
|
2209 |
// Then remove and signals if there are any.
|
|
|
2210 |
if (IS_TILETYPE(tile, MP_RAILWAY) &&
|
|
|
2211 |
(_map5[tile]&0xC0) == 0x40) {
|
|
|
2212 |
DoCommandByTile(tile, 0, 0, DC_EXEC, CMD_REMOVE_SIGNALS);
|
|
|
2213 |
}
|
|
|
2214 |
|
|
|
2215 |
// And also remove the rail.
|
|
|
2216 |
if (DoCommandByTile(tile, 0, bit, DC_EXEC, CMD_REMOVE_SINGLE_RAIL) == CMD_ERROR)
|
|
|
2217 |
return false;
|
|
|
2218 |
|
|
|
2219 |
// Find the direction at the other edge of the rail.
|
|
|
2220 |
ptr = _ai_table_15[p->ai.cur_dir_a^2];
|
|
|
2221 |
while (ptr[0] != bit) ptr+=2;
|
|
|
2222 |
p->ai.cur_dir_a = ptr[1] ^ 2;
|
|
|
2223 |
|
|
|
2224 |
// And then also switch tile.
|
|
|
2225 |
p->ai.cur_tile_a = TILE_MASK(p->ai.cur_tile_a - _tileoffs_by_dir[p->ai.cur_dir_a]);
|
|
|
2226 |
|
|
|
2227 |
return true;
|
|
|
2228 |
}
|
|
|
2229 |
|
|
|
2230 |
|
|
|
2231 |
static void AiBuildRailDestruct(Player *p)
|
|
|
2232 |
{
|
|
|
2233 |
// Decrease timeout.
|
|
|
2234 |
if (!--p->ai.state_counter) {
|
|
|
2235 |
p->ai.state_mode = 2;
|
|
|
2236 |
p->ai.state_counter = 0;
|
|
|
2237 |
}
|
|
|
2238 |
|
|
|
2239 |
// Don't do anything if the destination is already reached.
|
|
|
2240 |
if (p->ai.cur_tile_a == p->ai.start_tile_a)
|
|
|
2241 |
return;
|
|
|
2242 |
|
|
|
2243 |
AiRemoveTileAndGoForward(p);
|
|
|
2244 |
}
|
|
|
2245 |
|
|
|
2246 |
|
|
|
2247 |
static void AiBuildRail(Player *p)
|
|
|
2248 |
{
|
|
|
2249 |
int i;
|
|
|
2250 |
|
|
|
2251 |
if (p->ai.state_mode < 1) {
|
|
|
2252 |
// Construct mode, build new rail.
|
|
|
2253 |
AiBuildRailConstruct(p);
|
|
|
2254 |
} else if (p->ai.state_mode == 1) {
|
|
|
2255 |
|
|
|
2256 |
// Destruct mode, destroy the rail currently built.
|
|
|
2257 |
AiBuildRailDestruct(p);
|
|
|
2258 |
} else if (p->ai.state_mode == 2) {
|
|
|
2259 |
|
|
|
2260 |
// Terraform some and then try building again.
|
|
|
2261 |
for(i=0; i!=4; i++)
|
|
|
2262 |
AiDoTerraformLand(p->ai.cur_tile_a, p->ai.cur_dir_a, 3, 0);
|
|
|
2263 |
|
|
|
2264 |
if (++p->ai.state_counter == 4) {
|
|
|
2265 |
p->ai.state_counter = 0;
|
|
|
2266 |
p->ai.state_mode = 0;
|
|
|
2267 |
}
|
|
|
2268 |
}
|
|
|
2269 |
}
|
|
|
2270 |
|
|
|
2271 |
static void AiStateBuildRail(Player *p)
|
|
|
2272 |
{
|
|
|
2273 |
int num;
|
|
|
2274 |
AiBuildRec *aib;
|
|
|
2275 |
byte cmd;
|
|
|
2276 |
TileIndex tile;
|
|
|
2277 |
int dir;
|
|
|
2278 |
|
|
|
2279 |
// time out?
|
|
|
2280 |
if (++p->ai.timeout_counter == 1388) {
|
|
|
2281 |
p->ai.state = AIS_DELETE_RAIL_BLOCKS;
|
|
|
2282 |
return;
|
|
|
2283 |
}
|
|
|
2284 |
|
|
|
2285 |
// Currently building a rail between two points?
|
|
|
2286 |
if (p->ai.state_mode != 255) {
|
|
|
2287 |
AiBuildRail(p);
|
|
|
2288 |
|
|
|
2289 |
// Alternate between edges
|
|
|
2290 |
swap_tile(&p->ai.start_tile_a, &p->ai.start_tile_b);
|
|
|
2291 |
swap_tile(&p->ai.cur_tile_a, &p->ai.cur_tile_b);
|
|
|
2292 |
swap_byte(&p->ai.start_dir_a, &p->ai.start_dir_b);
|
|
|
2293 |
swap_byte(&p->ai.cur_dir_a, &p->ai.cur_dir_b);
|
|
|
2294 |
return;
|
|
|
2295 |
}
|
|
|
2296 |
|
|
|
2297 |
// Now, find two new points to build between
|
|
|
2298 |
num = p->ai.num_build_rec;
|
|
|
2299 |
aib = &p->ai.src;
|
|
|
2300 |
|
|
|
2301 |
for(;;) {
|
|
|
2302 |
cmd = aib->buildcmd_a;
|
|
|
2303 |
aib->buildcmd_a = 255;
|
|
|
2304 |
if (cmd != 255) break;
|
|
|
2305 |
|
|
|
2306 |
cmd = aib->buildcmd_b;
|
|
|
2307 |
aib->buildcmd_b = 255;
|
|
|
2308 |
if (cmd != 255) break;
|
|
|
2309 |
|
|
|
2310 |
aib++;
|
|
|
2311 |
if (--num == 0) {
|
|
|
2312 |
p->ai.state = AIS_BUILD_RAIL_VEH;
|
|
|
2313 |
p->ai.state_counter = 0; // timeout
|
|
|
2314 |
return;
|
|
|
2315 |
}
|
|
|
2316 |
}
|
|
|
2317 |
|
|
|
2318 |
// Find first edge to build from.
|
|
|
2319 |
tile = AiGetEdgeOfDefaultRailBlock(aib->cur_building_rule, aib->use_tile, cmd&3, &dir);
|
|
|
2320 |
p->ai.start_tile_a = tile;
|
|
|
2321 |
p->ai.cur_tile_a = tile;
|
|
|
2322 |
p->ai.start_dir_a = dir;
|
|
|
2323 |
p->ai.cur_dir_a = dir;
|
|
|
2324 |
DoCommandByTile(TILE_MASK(tile + _tileoffs_by_dir[dir]), 0, (dir&1)?1:0, DC_EXEC, CMD_REMOVE_SINGLE_RAIL);
|
|
|
2325 |
|
|
|
2326 |
assert(TILE_MASK(tile) != 0xFF00);
|
|
|
2327 |
|
|
|
2328 |
// Find second edge to build to
|
|
|
2329 |
aib = (&p->ai.src) + ((cmd >> 4)&0xF);
|
|
|
2330 |
tile = AiGetEdgeOfDefaultRailBlock(aib->cur_building_rule, aib->use_tile, (cmd>>2)&3, &dir);
|
|
|
2331 |
p->ai.start_tile_b = tile;
|
|
|
2332 |
p->ai.cur_tile_b = tile;
|
|
|
2333 |
p->ai.start_dir_b = dir;
|
|
|
2334 |
p->ai.cur_dir_b = dir;
|
|
|
2335 |
DoCommandByTile(TILE_MASK(tile + _tileoffs_by_dir[dir]), 0, (dir&1)?1:0, DC_EXEC, CMD_REMOVE_SINGLE_RAIL);
|
|
|
2336 |
|
|
|
2337 |
assert(TILE_MASK(tile) != 0xFF00);
|
|
|
2338 |
|
|
|
2339 |
// And setup state.
|
|
|
2340 |
p->ai.state_mode = 2;
|
|
|
2341 |
p->ai.state_counter = 0;
|
|
|
2342 |
p->ai.banned_tile_count = 0;
|
|
|
2343 |
}
|
|
|
2344 |
|
|
|
2345 |
static int AiGetStationIdByDef(TileIndex tile, int id)
|
|
|
2346 |
{
|
|
|
2347 |
const AiDefaultBlockData *p = _default_rail_track_data[id]->data;
|
|
|
2348 |
while (p->mode != 1) p++;
|
|
|
2349 |
return _map2[TILE_ADD(tile,p->tileoffs)];
|
|
|
2350 |
}
|
|
|
2351 |
|
|
|
2352 |
static void AiStateBuildRailVeh(Player *p)
|
|
|
2353 |
{
|
|
|
2354 |
const AiDefaultBlockData *ptr;
|
|
|
2355 |
TileIndex tile;
|
|
|
2356 |
int i, veh;
|
|
|
2357 |
int cargo;
|
|
|
2358 |
int32 cost;
|
|
|
2359 |
Vehicle *v;
|
|
|
2360 |
uint loco_id;
|
|
|
2361 |
|
|
|
2362 |
ptr = _default_rail_track_data[p->ai.src.cur_building_rule]->data;
|
|
|
2363 |
while (ptr->mode != 0) { ptr++; }
|
|
|
2364 |
|
|
|
2365 |
tile = TILE_ADD(p->ai.src.use_tile, ptr->tileoffs);
|
|
|
2366 |
|
|
|
2367 |
cargo = p->ai.cargo_type;
|
|
|
2368 |
for(i=0;;) {
|
|
|
2369 |
if (p->ai.wagon_list[i] == INVALID_VEHICLE) {
|
|
|
2370 |
veh = _cargoc.ai_railwagon[p->ai.railtype_to_use][cargo];
|
|
|
2371 |
cost = DoCommandByTile(tile, veh, 0, DC_EXEC, CMD_BUILD_RAIL_VEHICLE);
|
|
|
2372 |
if (cost == CMD_ERROR) goto handle_nocash;
|
|
|
2373 |
p->ai.wagon_list[i] = _new_wagon_id;
|
|
|
2374 |
p->ai.wagon_list[i+1] = INVALID_VEHICLE;
|
|
|
2375 |
return;
|
|
|
2376 |
}
|
|
|
2377 |
if (cargo == CT_MAIL)
|
|
|
2378 |
cargo = CT_PASSENGERS;
|
|
|
2379 |
if (++i == p->ai.num_wagons * 2 - 1)
|
|
|
2380 |
break;
|
|
|
2381 |
}
|
|
|
2382 |
|
|
|
2383 |
// Which locomotive to build?
|
|
|
2384 |
veh = AiChooseTrainToBuild(p->ai.railtype_to_use, p->player_money, (cargo!=CT_PASSENGERS)?1:0);
|
|
|
2385 |
if (veh == -1) {
|
|
|
2386 |
handle_nocash:
|
|
|
2387 |
// after a while, if AI still doesn't have cash, get out of this block by selling the wagons.
|
|
|
2388 |
if (++p->ai.state_counter == 1000) {
|
|
|
2389 |
for(i=0; p->ai.wagon_list[i] != INVALID_VEHICLE; i++) {
|
|
|
2390 |
cost = DoCommandByTile(tile, p->ai.wagon_list[i], 0, DC_EXEC, CMD_SELL_RAIL_WAGON);
|
|
|
2391 |
assert(cost != CMD_ERROR);
|
|
|
2392 |
}
|
|
|
2393 |
p->ai.state = AIS_0;
|
|
|
2394 |
}
|
|
|
2395 |
return;
|
|
|
2396 |
}
|
|
|
2397 |
|
|
|
2398 |
// Try to build the locomotive
|
|
|
2399 |
cost = DoCommandByTile(tile, veh, 0, DC_EXEC, CMD_BUILD_RAIL_VEHICLE);
|
|
|
2400 |
assert(cost != CMD_ERROR);
|
|
|
2401 |
loco_id = _new_train_id;
|
|
|
2402 |
|
|
|
2403 |
// Sell a vehicle if the train is double headed.
|
|
|
2404 |
v = &_vehicles[loco_id];
|
|
|
2405 |
if (v->next != NULL) {
|
|
|
2406 |
i = p->ai.wagon_list[p->ai.num_wagons*2-2];
|
|
|
2407 |
p->ai.wagon_list[p->ai.num_wagons*2-2] = INVALID_VEHICLE;
|
|
|
2408 |
DoCommandByTile(tile, i, 0, DC_EXEC, CMD_SELL_RAIL_WAGON);
|
|
|
2409 |
}
|
|
|
2410 |
|
|
|
2411 |
// Move the wagons onto the train
|
|
|
2412 |
for(i=0; p->ai.wagon_list[i] != INVALID_VEHICLE; i++) {
|
|
|
2413 |
DoCommandByTile(tile, p->ai.wagon_list[i] | (loco_id << 16), 0, DC_EXEC, CMD_MOVE_RAIL_VEHICLE);
|
|
|
2414 |
}
|
|
|
2415 |
|
|
|
2416 |
for(i=0; p->ai.order_list_blocks[i] != 0xFF; i++) {
|
|
|
2417 |
AiBuildRec *aib = (&p->ai.src) + p->ai.order_list_blocks[i];
|
|
|
2418 |
uint flags = (AiGetStationIdByDef(aib->use_tile, aib->cur_building_rule) << 8) + OT_GOTO_STATION;
|
|
|
2419 |
bool is_pass = (p->ai.cargo_type == CT_PASSENGERS ||
|
|
|
2420 |
p->ai.cargo_type == CT_MAIL ||
|
|
|
2421 |
(_opt.landscape==LT_NORMAL && p->ai.cargo_type == CT_VALUABLES));
|
|
|
2422 |
|
|
|
2423 |
if (!is_pass && i == 1) flags |= OF_UNLOAD;
|
|
|
2424 |
if (p->ai.num_want_fullload != 0 && (is_pass || i == 0)) flags |= OF_FULL_LOAD;
|
|
|
2425 |
|
|
|
2426 |
DoCommandByTile(0, loco_id + (i << 16), flags, DC_EXEC, CMD_INSERT_ORDER);
|
|
|
2427 |
}
|
|
|
2428 |
|
|
|
2429 |
DoCommandByTile(0, loco_id, 0, DC_EXEC, CMD_START_STOP_TRAIN);
|
|
|
2430 |
|
|
|
2431 |
if (p->ai.num_want_fullload != 0)
|
|
|
2432 |
p->ai.num_want_fullload--;
|
|
|
2433 |
|
|
|
2434 |
if (--p->ai.num_loco_to_build != 0) {
|
|
|
2435 |
// p->ai.loco_id = INVALID_VEHICLE;
|
|
|
2436 |
p->ai.wagon_list[0] = INVALID_VEHICLE;
|
|
|
2437 |
} else {
|
|
|
2438 |
p->ai.state = AIS_0;
|
|
|
2439 |
}
|
|
|
2440 |
}
|
|
|
2441 |
|
|
|
2442 |
static void AiStateDeleteRailBlocks(Player *p)
|
|
|
2443 |
{
|
|
|
2444 |
int num;
|
|
|
2445 |
AiBuildRec *aib;
|
|
|
2446 |
const AiDefaultBlockData *b;
|
|
|
2447 |
|
|
|
2448 |
num = p->ai.num_build_rec;
|
|
|
2449 |
aib = &p->ai.src;
|
|
|
2450 |
do {
|
|
|
2451 |
if (aib->cur_building_rule != 255) {
|
|
|
2452 |
b = _default_rail_track_data[aib->cur_building_rule]->data;
|
|
|
2453 |
while (b->mode != 4) {
|
|
|
2454 |
DoCommandByTile(TILE_ADD(aib->use_tile, b->tileoffs), 0, 0, DC_EXEC, CMD_LANDSCAPE_CLEAR);
|
|
|
2455 |
b++;
|
|
|
2456 |
}
|
|
|
2457 |
}
|
|
|
2458 |
} while (++aib,--num);
|
|
|
2459 |
|
|
|
2460 |
p->ai.state = AIS_0;
|
|
|
2461 |
}
|
|
|
2462 |
|
|
|
2463 |
static bool AiCheckRoadResources(TileIndex tile, const AiDefaultBlockData *p, byte cargo)
|
|
|
2464 |
{
|
|
|
2465 |
uint values[NUM_CARGO];
|
|
|
2466 |
for(;;p++) {
|
|
|
2467 |
if (p->mode == 4) {
|
|
|
2468 |
return true;
|
|
|
2469 |
} else if (p->mode == 1) {
|
|
|
2470 |
uint tile2 = TILE_ADD(tile, p->tileoffs);
|
|
|
2471 |
if (cargo & 0x80) {
|
|
|
2472 |
GetProductionAroundTiles(values, tile2, 1, 1);
|
|
|
2473 |
return values[cargo & 0x7F] != 0;
|
|
|
2474 |
} else {
|
|
|
2475 |
GetAcceptanceAroundTiles(values, tile2, 1, 1);
|
|
|
2476 |
return (values[cargo]&~7) != 0;
|
|
|
2477 |
}
|
|
|
2478 |
}
|
|
|
2479 |
}
|
|
|
2480 |
}
|
|
|
2481 |
|
|
|
2482 |
static bool _want_road_truck_station;
|
|
|
2483 |
static int32 AiDoBuildDefaultRoadBlock(TileIndex tile, const AiDefaultBlockData *p, byte flag);
|
|
|
2484 |
|
|
|
2485 |
// Returns rule and cost
|
|
|
2486 |
static int AiFindBestDefaultRoadBlock(TileIndex tile, byte direction, byte cargo, int32 *cost)
|
|
|
2487 |
{
|
|
|
2488 |
int i;
|
|
|
2489 |
const AiDefaultRoadBlock *p;
|
|
|
2490 |
|
|
|
2491 |
_want_road_truck_station = (cargo & 0x7F) != CT_PASSENGERS;
|
|
|
2492 |
|
|
|
2493 |
for(i=0; (p = _road_default_block_data[i]) != NULL; i++) {
|
|
|
2494 |
if (p->dir == direction) {
|
|
|
2495 |
*cost = AiDoBuildDefaultRoadBlock(tile, p->data, 0);
|
|
|
2496 |
if (*cost != CMD_ERROR && AiCheckRoadResources(tile, p->data, cargo))
|
|
|
2497 |
return i;
|
|
|
2498 |
}
|
|
|
2499 |
}
|
|
|
2500 |
|
|
|
2501 |
return -1;
|
|
|
2502 |
}
|
|
|
2503 |
|
|
|
2504 |
static int32 AiDoBuildDefaultRoadBlock(TileIndex tile, const AiDefaultBlockData *p, byte flag)
|
|
|
2505 |
{
|
|
|
2506 |
int32 r;
|
|
|
2507 |
int32 total_cost = 0;
|
|
|
2508 |
Town *t = NULL;
|
|
|
2509 |
int rating = 0;
|
|
|
2510 |
int roadflag = 0;
|
|
|
2511 |
|
|
|
2512 |
for(;p->mode != 4;p++) {
|
|
|
2513 |
uint c = TILE_MASK(tile+ p->tileoffs);
|
|
|
2514 |
|
|
|
2515 |
_cleared_town = NULL;
|
|
|
2516 |
|
|
|
2517 |
if (p->mode == 2) {
|
|
|
2518 |
if (IS_TILETYPE(c, MP_STREET) &&
|
|
|
2519 |
(_map5[c]&0xF0)==0 &&
|
|
|
2520 |
(_map5[c]&p->attr)!=0) {
|
|
|
2521 |
roadflag |= 2;
|
|
|
2522 |
|
|
|
2523 |
// all bits are already built?
|
|
|
2524 |
if ((_map5[c]&p->attr)==p->attr)
|
|
|
2525 |
continue;
|
|
|
2526 |
}
|
|
|
2527 |
|
|
|
2528 |
r = DoCommandByTile(c, p->attr, 0, flag | DC_AUTO | DC_NO_WATER, CMD_BUILD_ROAD);
|
|
|
2529 |
if (r == CMD_ERROR)
|
|
|
2530 |
return CMD_ERROR;
|
|
|
2531 |
total_cost += r;
|
|
|
2532 |
|
|
|
2533 |
continue;
|
|
|
2534 |
}
|
|
|
2535 |
|
|
|
2536 |
if (p->mode == 0) {
|
|
|
2537 |
// Depot
|
|
|
2538 |
r = DoCommandByTile(c, p->attr, 0, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_BUILD_ROAD_DEPOT);
|
|
|
2539 |
goto clear_town_stuff;
|
|
|
2540 |
} else if (p->mode == 1) {
|
|
|
2541 |
if (_want_road_truck_station) {
|
|
|
2542 |
// Truck station
|
|
|
2543 |
r = DoCommandByTile(c, p->attr, 0, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_BUILD_TRUCK_STATION);
|
|
|
2544 |
} else {
|
|
|
2545 |
// Bus station
|
|
|
2546 |
r = DoCommandByTile(c, p->attr, 0, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_BUILD_BUS_STATION);
|
|
|
2547 |
}
|
|
|
2548 |
clear_town_stuff:;
|
|
|
2549 |
|
|
|
2550 |
if (r == CMD_ERROR) return CMD_ERROR;
|
|
|
2551 |
total_cost += r;
|
|
|
2552 |
|
|
|
2553 |
if (_cleared_town != NULL) {
|
|
|
2554 |
if (t != NULL && t != _cleared_town)
|
|
|
2555 |
return CMD_ERROR;
|
|
|
2556 |
t = _cleared_town;
|
|
|
2557 |
rating += _cleared_town_rating;
|
|
|
2558 |
}
|
|
|
2559 |
} else if (p->mode == 3) {
|
|
|
2560 |
if (flag & DC_EXEC)
|
|
|
2561 |
continue;
|
|
|
2562 |
|
|
|
2563 |
if (GetTileSlope(c, NULL) != 0)
|
|
|
2564 |
return CMD_ERROR;
|
|
|
2565 |
|
|
|
2566 |
if (!(IS_TILETYPE(c, MP_STREET) && (_map5[c]&0xF0)==0)) {
|
|
|
2567 |
r = DoCommandByTile(c, 0, 0, flag | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, CMD_LANDSCAPE_CLEAR);
|
|
|
2568 |
if (r == CMD_ERROR) return CMD_ERROR;
|
|
|
2569 |
}
|
|
|
2570 |
|
|
|
2571 |
}
|
|
|
2572 |
}
|
|
|
2573 |
|
|
|
2574 |
if (!_want_road_truck_station && !(roadflag&2))
|
|
|
2575 |
return CMD_ERROR;
|
|
|
2576 |
|
|
|
2577 |
if (!(flag & DC_EXEC)) {
|
|
|
2578 |
if (t != NULL && rating > t->ratings[_current_player]) {
|
|
|
2579 |
return CMD_ERROR;
|
|
|
2580 |
}
|
|
|
2581 |
}
|
|
|
2582 |
return total_cost;
|
|
|
2583 |
}
|
|
|
2584 |
|
|
|
2585 |
// Make sure the blocks are not too close to each other
|
|
|
2586 |
static bool AiCheckBlockDistances(Player *p, TileIndex tile)
|
|
|
2587 |
{
|
|
|
2588 |
AiBuildRec *aib;
|
|
|
2589 |
int num;
|
|
|
2590 |
|
|
|
2591 |
num = p->ai.num_build_rec;
|
|
|
2592 |
aib = &p->ai.src;
|
|
|
2593 |
|
|
|
2594 |
do {
|
|
|
2595 |
if (aib->cur_building_rule != 255) {
|
|
|
2596 |
if (GetTileDist(aib->use_tile, tile) < 9)
|
|
|
2597 |
return false;
|
|
|
2598 |
}
|
|
|
2599 |
} while (++aib, --num);
|
|
|
2600 |
|
|
|
2601 |
return true;
|
|
|
2602 |
}
|
|
|
2603 |
|
|
|
2604 |
|
|
|
2605 |
static void AiStateBuildDefaultRoadBlocks(Player *p)
|
|
|
2606 |
{
|
|
|
2607 |
int i, j;
|
|
|
2608 |
AiBuildRec *aib;
|
|
|
2609 |
int rule;
|
|
|
2610 |
int32 cost;
|
|
|
2611 |
|
|
|
2612 |
// time out?
|
|
|
2613 |
if (++p->ai.timeout_counter == 1388) {
|
|
|
2614 |
p->ai.state = AIS_DELETE_RAIL_BLOCKS;
|
|
|
2615 |
return;
|
|
|
2616 |
}
|
|
|
2617 |
|
|
|
2618 |
// do the following 8 times
|
|
|
2619 |
i = 8;
|
|
|
2620 |
do {
|
|
|
2621 |
// check if we can build the default track
|
|
|
2622 |
aib = &p->ai.src;
|
|
|
2623 |
j = p->ai.num_build_rec;
|
|
|
2624 |
do {
|
|
|
2625 |
// this item has already been built?
|
|
|
2626 |
if (aib->cur_building_rule != 255)
|
|
|
2627 |
continue;
|
|
|
2628 |
|
|
|
2629 |
// adjust the coordinate randomly,
|
|
|
2630 |
// to make sure that we find a position.
|
|
|
2631 |
aib->use_tile = AdjustTileCoordRandomly(aib->spec_tile, aib->rand_rng);
|
|
|
2632 |
|
|
|
2633 |
// check if the road can be built there.
|
|
|
2634 |
rule = AiFindBestDefaultRoadBlock(aib->use_tile,
|
|
|
2635 |
aib->direction, aib->cargo, &cost);
|
|
|
2636 |
|
|
|
2637 |
if (rule == -1) {
|
|
|
2638 |
// cannot build, terraform after a while
|
|
|
2639 |
if (p->ai.state_counter >= 600) {
|
|
|
2640 |
AiDoTerraformLand(aib->use_tile, Random()&3, 3, (int8)p->ai.state_mode);
|
|
|
2641 |
}
|
|
|
2642 |
// also try the other terraform direction
|
|
|
2643 |
if (++p->ai.state_counter >= 1000) {
|
|
|
2644 |
p->ai.state_counter = 0;
|
|
|
2645 |
p->ai.state_mode = -p->ai.state_mode;
|
|
|
2646 |
}
|
|
|
2647 |
} else if (CheckPlayerHasMoney(cost) && AiCheckBlockDistances(p,aib->use_tile)) {
|
|
|
2648 |
int32 r;
|
|
|
2649 |
|
|
|
2650 |
// player has money, build it.
|
|
|
2651 |
aib->cur_building_rule = rule;
|
|
|
2652 |
|
|
|
2653 |
r = AiDoBuildDefaultRoadBlock(
|
|
|
2654 |
aib->use_tile,
|
|
|
2655 |
_road_default_block_data[rule]->data,
|
|
|
2656 |
DC_EXEC | DC_NO_TOWN_RATING
|
|
|
2657 |
);
|
|
|
2658 |
assert(r != CMD_ERROR);
|
|
|
2659 |
}
|
|
|
2660 |
} while (++aib,--j);
|
|
|
2661 |
} while (--i);
|
|
|
2662 |
|
|
|
2663 |
// check if we're done with all of them
|
|
|
2664 |
aib = &p->ai.src;
|
|
|
2665 |
j = p->ai.num_build_rec;
|
|
|
2666 |
do {
|
|
|
2667 |
if (aib->cur_building_rule == 255)
|
|
|
2668 |
return;
|
|
|
2669 |
} while (++aib,--j);
|
|
|
2670 |
|
|
|
2671 |
// yep, all are done. switch state to the rail building state.
|
|
|
2672 |
p->ai.state = AIS_BUILD_ROAD;
|
|
|
2673 |
p->ai.state_mode = 255;
|
|
|
2674 |
}
|
|
|
2675 |
|
|
|
2676 |
typedef struct {
|
|
|
2677 |
TileIndex final_tile;
|
|
|
2678 |
byte final_dir;
|
|
|
2679 |
byte depth;
|
|
|
2680 |
byte recursive_mode;
|
|
|
2681 |
byte cur_best_dir;
|
|
|
2682 |
byte best_dir;
|
|
|
2683 |
byte cur_best_depth;
|
|
|
2684 |
byte best_depth;
|
|
|
2685 |
uint cur_best_dist;
|
|
|
2686 |
const byte *best_ptr;
|
|
|
2687 |
uint best_dist;
|
|
|
2688 |
TileIndex cur_best_tile, best_tile;
|
|
|
2689 |
TileIndex bridge_end_tile;
|
|
|
2690 |
Player *player;
|
|
|
2691 |
TileInfo ti;
|
|
|
2692 |
} AiRoadFinder;
|
|
|
2693 |
|
|
|
2694 |
typedef struct AiRoadEnum {
|
|
|
2695 |
TileIndex dest;
|
|
|
2696 |
TileIndex best_tile;
|
|
|
2697 |
int best_track;
|
|
|
2698 |
uint best_dist;
|
|
|
2699 |
} AiRoadEnum;
|
|
|
2700 |
|
|
|
2701 |
static const byte _dir_by_track[] = {
|
|
|
2702 |
0,1,0,1,2,1, 0,0,
|
|
|
2703 |
2,3,3,2,3,0,
|
|
|
2704 |
};
|
|
|
2705 |
|
|
|
2706 |
static void AiBuildRoadRecursive(AiRoadFinder *arf, TileIndex tile, int dir);
|
|
|
2707 |
|
|
|
2708 |
static bool AiCheckRoadPathBetter(AiRoadFinder *arf, const byte *p)
|
|
|
2709 |
{
|
|
|
2710 |
bool better = false;
|
|
|
2711 |
|
|
|
2712 |
if (arf->recursive_mode < 1) {
|
|
|
2713 |
// Mode is 0. This means destination has not been found yet.
|
|
|
2714 |
// If the found path is shorter than the current one, remember it.
|
|
|
2715 |
if (arf->cur_best_dist < arf->best_dist ||
|
|
|
2716 |
(arf->cur_best_dist == arf->best_dist && arf->cur_best_depth < arf->best_depth)) {
|
|
|
2717 |
arf->best_depth = arf->cur_best_depth;
|
|
|
2718 |
arf->best_dist = arf->cur_best_dist;
|
|
|
2719 |
arf->best_dir = arf->cur_best_dir;
|
|
|
2720 |
arf->best_ptr = p;
|
|
|
2721 |
arf->best_tile = arf->cur_best_tile;
|
|
|
2722 |
better = true;
|
|
|
2723 |
}
|
|
|
2724 |
} else if (arf->recursive_mode > 1) {
|
|
|
2725 |
// Mode is 2.
|
|
|
2726 |
if (arf->best_dist != 0 || arf->cur_best_depth < arf->best_depth) {
|
|
|
2727 |
arf->best_depth = arf->cur_best_depth;
|
|
|
2728 |
arf->best_dist = 0;
|
|
|
2729 |
arf->best_ptr = p;
|
|
|
2730 |
arf->best_tile = 0;
|
|
|
2731 |
better = true;
|
|
|
2732 |
}
|
|
|
2733 |
}
|
|
|
2734 |
arf->recursive_mode = 0;
|
|
|
2735 |
arf->cur_best_dist = (uint)-1;
|
|
|
2736 |
arf->cur_best_depth = 0xff;
|
|
|
2737 |
|
|
|
2738 |
return better;
|
|
|
2739 |
}
|
|
|
2740 |
|
|
|
2741 |
|
|
|
2742 |
static bool AiEnumFollowRoad(uint tile, AiRoadEnum *a, int track, uint length, byte *state)
|
|
|
2743 |
{
|
|
|
2744 |
uint dist = GetTileDist(tile, a->dest);
|
|
|
2745 |
uint tile2;
|
|
|
2746 |
|
|
|
2747 |
if (dist <= a->best_dist) {
|
|
|
2748 |
tile2 = TILE_MASK(tile + _tileoffs_by_dir[_dir_by_track[track]]);
|
|
|
2749 |
if (IS_TILETYPE(tile2, MP_STREET) &&
|
|
|
2750 |
(_map5[tile2]&0xF0) == 0) {
|
|
|
2751 |
a->best_dist = dist;
|
|
|
2752 |
a->best_tile = tile;
|
|
|
2753 |
a->best_track = track;
|
|
|
2754 |
}
|
|
|
2755 |
}
|
|
|
2756 |
|
|
|
2757 |
return false;
|
|
|
2758 |
}
|
|
|
2759 |
|
|
|
2760 |
static const uint16 _ai_road_table_and[4] = {
|
|
|
2761 |
0x1009,
|
|
|
2762 |
0x16,
|
|
|
2763 |
0x520,
|
|
|
2764 |
0x2A00,
|
|
|
2765 |
};
|
|
|
2766 |
|
|
|
2767 |
bool AiCheckRoadFinished(Player *p)
|
|
|
2768 |
{
|
|
|
2769 |
AiRoadEnum are;
|
|
|
2770 |
uint tile;
|
|
|
2771 |
int dir = p->ai.cur_dir_a;
|
|
|
2772 |
uint32 bits;
|
|
|
2773 |
int i;
|
|
|
2774 |
|
|
|
2775 |
are.dest = p->ai.cur_tile_b;
|
|
|
2776 |
tile = TILE_MASK(p->ai.cur_tile_a + _tileoffs_by_dir[dir]);
|
|
|
2777 |
|
|
|
2778 |
bits = GetTileTrackStatus(tile, 2) & _ai_road_table_and[dir];
|
|
|
2779 |
if (bits == 0) {
|
|
|
2780 |
return false;
|
|
|
2781 |
}
|
|
|
2782 |
|
|
|
2783 |
are.best_dist = (uint)-1;
|
|
|
2784 |
|
|
|
2785 |
for_each_bit(i, bits) {
|
|
|
2786 |
FollowTrack(tile, 0x3002, _dir_by_track[i], (TPFEnumProc*)AiEnumFollowRoad, NULL, &are);
|
|
|
2787 |
}
|
|
|
2788 |
|
|
|
2789 |
if (GetTileDist(tile, are.dest) <= are.best_dist)
|
|
|
2790 |
return false;
|
|
|
2791 |
|
|
|
2792 |
if (are.best_dist == 0)
|
|
|
2793 |
return true;
|
|
|
2794 |
|
|
|
2795 |
p->ai.cur_tile_a = are.best_tile;
|
|
|
2796 |
p->ai.cur_dir_a = _dir_by_track[are.best_track];
|
|
|
2797 |
return false;
|
|
|
2798 |
}
|
|
|
2799 |
|
|
|
2800 |
|
|
|
2801 |
static bool AiBuildRoadHelper(uint tile, int flags, int type)
|
|
|
2802 |
{
|
|
|
2803 |
static const byte _road_bits[] = {
|
|
|
2804 |
8+2,
|
|
|
2805 |
1+4,
|
|
|
2806 |
1+8,
|
|
|
2807 |
4+2,
|
|
|
2808 |
1+2,
|
|
|
2809 |
8+4,
|
|
|
2810 |
};
|
|
|
2811 |
return DoCommandByTile(tile, _road_bits[type], 0, flags, CMD_BUILD_ROAD) != CMD_ERROR;
|
|
|
2812 |
}
|
|
|
2813 |
|
|
|
2814 |
static void FORCEINLINE AiCheckBuildRoadBridgeHere(AiRoadFinder *arf, TileIndex tile, const byte *p)
|
|
|
2815 |
{
|
|
|
2816 |
TileIndex tile_new;
|
|
|
2817 |
bool flag;
|
|
|
2818 |
|
|
|
2819 |
int dir2 = p[0] & 3;
|
|
|
2820 |
|
|
|
2821 |
FindLandscapeHeightByTile(&arf->ti, tile);
|
|
|
2822 |
if (arf->ti.tileh == _dir_table_1[dir2] || (arf->ti.tileh==0 && arf->ti.z!=0)) {
|
|
|
2823 |
tile_new = tile;
|
|
|
2824 |
// Allow bridges directly over bottom tiles
|
|
|
2825 |
flag = arf->ti.z == 0;
|
|
|
2826 |
for(;;) {
|
|
|
2827 |
if (tile_new < -_tileoffs_by_dir[dir2]) return; // Wraping around map, no bridge possible!
|
|
|
2828 |
tile_new = TILE_MASK(tile_new + _tileoffs_by_dir[dir2]);
|
|
|
2829 |
FindLandscapeHeightByTile(&arf->ti, tile_new);
|
|
|
2830 |
if (arf->ti.tileh != 0 || arf->ti.type == MP_CLEAR || arf->ti.type == MP_TREES) {
|
|
|
2831 |
// Allow a bridge if either we have a tile that's water, rail or street,
|
|
|
2832 |
// or if we found an up tile.
|
|
|
2833 |
if (!flag) return;
|
|
|
2834 |
break;
|
|
|
2835 |
}
|
|
|
2836 |
if (arf->ti.type != MP_WATER && arf->ti.type != MP_RAILWAY && arf->ti.type != MP_STREET)
|
|
|
2837 |
return;
|
|
|
2838 |
flag = true;
|
|
|
2839 |
}
|
|
|
2840 |
|
|
|
2841 |
// Is building a (rail)bridge possible at this place (type doesn't matter)?
|
|
|
2842 |
if (DoCommandByTile(tile_new, tile, 0x8000, DC_AUTO, CMD_BUILD_BRIDGE) == CMD_ERROR)
|
|
|
2843 |
return;
|
|
|
2844 |
AiBuildRoadRecursive(arf, tile_new, dir2);
|
|
|
2845 |
|
|
|
2846 |
// At the bottom depth, check if the new path is better than the old one.
|
|
|
2847 |
if (arf->depth == 1) {
|
|
|
2848 |
if (AiCheckRoadPathBetter(arf, p))
|
|
|
2849 |
arf->bridge_end_tile = tile_new;
|
|
|
2850 |
}
|
|
|
2851 |
}
|
|
|
2852 |
}
|
|
|
2853 |
|
|
|
2854 |
static void FORCEINLINE AiCheckBuildRoadTunnelHere(AiRoadFinder *arf, TileIndex tile, const byte *p)
|
|
|
2855 |
{
|
|
|
2856 |
FindLandscapeHeightByTile(&arf->ti, tile);
|
|
|
2857 |
|
|
|
2858 |
if (arf->ti.tileh == _dir_table_2[p[0]&3] && arf->ti.z!=0) {
|
|
|
2859 |
int32 cost = DoCommandByTile(tile, 0x200, 0, DC_AUTO, CMD_BUILD_TUNNEL);
|
|
|
2860 |
|
|
|
2861 |
if (cost != CMD_ERROR && cost <= (arf->player->player_money>>4)) {
|
|
|
2862 |
AiBuildRoadRecursive(arf, _build_tunnel_endtile, p[0]&3);
|
|
|
2863 |
if (arf->depth == 1) {
|
|
|
2864 |
AiCheckRoadPathBetter(arf, p);
|
|
|
2865 |
}
|
|
|
2866 |
}
|
|
|
2867 |
}
|
|
|
2868 |
}
|
|
|
2869 |
|
|
|
2870 |
|
|
|
2871 |
|
|
|
2872 |
static void AiBuildRoadRecursive(AiRoadFinder *arf, TileIndex tile, int dir)
|
|
|
2873 |
{
|
|
|
2874 |
const byte *p;
|
|
|
2875 |
|
|
|
2876 |
tile = TILE_MASK(tile + _tileoffs_by_dir[dir]);
|
|
|
2877 |
|
|
|
2878 |
// Reached destination?
|
|
|
2879 |
if (tile == arf->final_tile) {
|
|
|
2880 |
if ((arf->final_dir^2) == dir) {
|
|
|
2881 |
arf->recursive_mode = 2;
|
|
|
2882 |
arf->cur_best_depth = arf->depth;
|
|
|
2883 |
}
|
|
|
2884 |
return;
|
|
|
2885 |
}
|
|
|
2886 |
|
|
|
2887 |
// Depth too deep?
|
|
|
2888 |
if (arf->depth >= 4) {
|
|
|
2889 |
uint dist = GetTileDist1Db(tile, arf->final_tile);
|
|
|
2890 |
if (dist < arf->cur_best_dist) {
|
|
|
2891 |
// Store the tile that is closest to the final position.
|
|
|
2892 |
arf->cur_best_dist = dist;
|
|
|
2893 |
arf->cur_best_tile = tile;
|
|
|
2894 |
arf->cur_best_dir = dir;
|
|
|
2895 |
arf->cur_best_depth = arf->depth;
|
|
|
2896 |
}
|
|
|
2897 |
return;
|
|
|
2898 |
}
|
|
|
2899 |
|
|
|
2900 |
// Increase recursion depth
|
|
|
2901 |
arf->depth++;
|
|
|
2902 |
|
|
|
2903 |
// Grab pointer to list of stuff that is possible to build
|
|
|
2904 |
p = _ai_table_15[dir];
|
|
|
2905 |
|
|
|
2906 |
// Try to build a single rail in all directions.
|
|
|
2907 |
FindLandscapeHeightByTile(&arf->ti, tile);
|
|
|
2908 |
if (arf->ti.z == 0) {
|
|
|
2909 |
p += 6;
|
|
|
2910 |
} else {
|
|
|
2911 |
do {
|
|
|
2912 |
// Make sure that a road can be built here.
|
|
|
2913 |
if (AiBuildRoadHelper(tile, DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, p[0])) {
|
|
|
2914 |
AiBuildRoadRecursive(arf, tile, p[1]);
|
|
|
2915 |
}
|
|
|
2916 |
|
|
|
2917 |
// At the bottom depth?
|
|
|
2918 |
if (arf->depth == 1) {
|
|
|
2919 |
AiCheckRoadPathBetter(arf, p);
|
|
|
2920 |
}
|
|
|
2921 |
|
|
|
2922 |
p += 2;
|
|
|
2923 |
} while (!(p[0]&0x80));
|
|
|
2924 |
}
|
|
|
2925 |
|
|
|
2926 |
AiCheckBuildRoadBridgeHere(arf, tile, p);
|
|
|
2927 |
AiCheckBuildRoadTunnelHere(arf, tile, p+1);
|
|
|
2928 |
|
|
|
2929 |
arf->depth--;
|
|
|
2930 |
}
|
|
|
2931 |
|
|
|
2932 |
int sw;
|
|
|
2933 |
|
|
|
2934 |
|
|
|
2935 |
static void AiBuildRoadConstruct(Player *p)
|
|
|
2936 |
{
|
|
|
2937 |
AiRoadFinder arf;
|
|
|
2938 |
int i;
|
|
|
2939 |
uint tile;
|
|
|
2940 |
|
|
|
2941 |
// Reached destination?
|
|
|
2942 |
if (AiCheckRoadFinished(p)) {
|
|
|
2943 |
p->ai.state_mode = 255;
|
|
|
2944 |
return;
|
|
|
2945 |
}
|
|
|
2946 |
|
|
|
2947 |
// Setup recursive finder and call it.
|
|
|
2948 |
arf.player = p;
|
|
|
2949 |
arf.final_tile = p->ai.cur_tile_b;
|
|
|
2950 |
arf.final_dir = p->ai.cur_dir_b;
|
|
|
2951 |
arf.depth = 0;
|
|
|
2952 |
arf.recursive_mode = 0;
|
|
|
2953 |
arf.best_ptr = NULL;
|
|
|
2954 |
arf.cur_best_dist = (uint)-1;
|
|
|
2955 |
arf.cur_best_depth = 0xff;
|
|
|
2956 |
arf.best_dist = (uint)-1;
|
|
|
2957 |
arf.best_depth = 0xff;
|
|
|
2958 |
arf.cur_best_tile = 0;
|
|
|
2959 |
arf.best_tile = 0;
|
|
|
2960 |
AiBuildRoadRecursive(&arf, p->ai.cur_tile_a, p->ai.cur_dir_a);
|
|
|
2961 |
|
|
|
2962 |
// Reached destination?
|
|
|
2963 |
if (arf.recursive_mode == 2 && arf.cur_best_depth == 0) {
|
|
|
2964 |
p->ai.state_mode = 255;
|
|
|
2965 |
return;
|
|
|
2966 |
}
|
|
|
2967 |
|
|
|
2968 |
// Didn't find anything to build?
|
|
|
2969 |
if (arf.best_ptr == NULL) {
|
|
|
2970 |
// Terraform some
|
|
|
2971 |
do_some_terraform:
|
|
|
2972 |
for(i=0; i!=5; i++)
|
|
|
2973 |
AiDoTerraformLand(p->ai.cur_tile_a, p->ai.cur_dir_a, 3, 0);
|
|
|
2974 |
|
|
|
2975 |
if (++p->ai.state_counter == 21) {
|
|
|
2976 |
p->ai.state_mode = 1;
|
|
|
2977 |
|
|
|
2978 |
p->ai.cur_tile_a = TILE_MASK(p->ai.cur_tile_a + _tileoffs_by_dir[p->ai.cur_dir_a]);
|
|
|
2979 |
p->ai.cur_dir_a ^= 2;
|
|
|
2980 |
p->ai.state_counter = 0;
|
|
|
2981 |
}
|
|
|
2982 |
return;
|
|
|
2983 |
}
|
|
|
2984 |
|
|
|
2985 |
tile = TILE_MASK(p->ai.cur_tile_a + _tileoffs_by_dir[p->ai.cur_dir_a]);
|
|
|
2986 |
|
|
|
2987 |
if (arf.best_ptr[0]&0x80) {
|
|
|
2988 |
int i;
|
|
|
2989 |
int32 bridge_len;
|
|
|
2990 |
p->ai.cur_tile_a = arf.bridge_end_tile;
|
|
|
2991 |
bridge_len = GetBridgeLength(tile, p->ai.cur_tile_a); // tile
|
|
|
2992 |
|
|
|
2993 |
/* Figure out what (road)bridge type to build
|
|
|
2994 |
start with best bridge, then go down to worse and worse bridges
|
|
|
2995 |
unnecessary to check for worse bridge (i=0), since AI will always build that.
|
|
|
2996 |
AI is so fucked up that fixing this small thing will probably not solve a thing
|
|
|
2997 |
*/
|
|
|
2998 |
for(i = 10; i != 0; i--) {
|
|
|
2999 |
if (CheckBridge_Stuff(i, bridge_len)) {
|
|
|
3000 |
int32 cost = DoCommandByTile(tile, p->ai.cur_tile_a, i + (0x80 << 8), DC_AUTO, CMD_BUILD_BRIDGE);
|
|
|
3001 |
if (cost != CMD_ERROR && cost < (p->player_money >> 5))
|
|
|
3002 |
break;
|
|
|
3003 |
}
|
|
|
3004 |
}
|
|
|
3005 |
|
|
|
3006 |
// Build it
|
|
|
3007 |
DoCommandByTile(tile, p->ai.cur_tile_a, i + (0x80 << 8), DC_AUTO | DC_EXEC, CMD_BUILD_BRIDGE);
|
|
|
3008 |
|
|
|
3009 |
p->ai.state_counter = 0;
|
|
|
3010 |
} else if (arf.best_ptr[0]&0x40) {
|
|
|
3011 |
// tunnel
|
|
|
3012 |
DoCommandByTile(tile, 0x200, 0, DC_AUTO | DC_EXEC, CMD_BUILD_TUNNEL);
|
|
|
3013 |
p->ai.cur_tile_a = _build_tunnel_endtile;
|
|
|
3014 |
p->ai.state_counter = 0;
|
|
|
3015 |
} else {
|
|
|
3016 |
|
|
|
3017 |
// road
|
|
|
3018 |
if (!AiBuildRoadHelper(tile, DC_EXEC | DC_AUTO | DC_NO_WATER | DC_AI_BUILDING, arf.best_ptr[0]))
|
|
|
3019 |
goto do_some_terraform;
|
|
|
3020 |
|
|
|
3021 |
p->ai.cur_dir_a = arf.best_ptr[1];
|
|
|
3022 |
p->ai.cur_tile_a = tile;
|
|
|
3023 |
p->ai.state_counter = 0;
|
|
|
3024 |
}
|
|
|
3025 |
|
|
|
3026 |
if (arf.best_tile != 0) {
|
|
|
3027 |
for(i=0; i!=2; i++)
|
|
|
3028 |
AiDoTerraformLand(arf.best_tile, arf.best_dir, 3, 0);
|
|
|
3029 |
}
|
|
|
3030 |
}
|
|
|
3031 |
|
|
|
3032 |
|
|
|
3033 |
static void AiBuildRoad(Player *p)
|
|
|
3034 |
{
|
|
|
3035 |
int i;
|
|
|
3036 |
|
|
|
3037 |
if (p->ai.state_mode < 1) {
|
|
|
3038 |
// Construct mode, build new road.
|
|
|
3039 |
AiBuildRoadConstruct(p);
|
|
|
3040 |
} else if (p->ai.state_mode == 1) {
|
|
|
3041 |
// Destruct mode, not implemented for roads.
|
|
|
3042 |
p->ai.state_mode = 2;
|
|
|
3043 |
p->ai.state_counter = 0;
|
|
|
3044 |
} else if (p->ai.state_mode == 2) {
|
|
|
3045 |
|
|
|
3046 |
// Terraform some and then try building again.
|
|
|
3047 |
for(i=0; i!=4; i++)
|
|
|
3048 |
AiDoTerraformLand(p->ai.cur_tile_a, p->ai.cur_dir_a, 3, 0);
|
|
|
3049 |
|
|
|
3050 |
if (++p->ai.state_counter == 4) {
|
|
|
3051 |
p->ai.state_counter = 0;
|
|
|
3052 |
p->ai.state_mode = 0;
|
|
|
3053 |
}
|
|
|
3054 |
}
|
|
|
3055 |
}
|
|
|
3056 |
|
|
|
3057 |
static TileIndex AiGetRoadBlockEdge(byte rule, TileIndex tile, int *dir)
|
|
|
3058 |
{
|
|
|
3059 |
const AiDefaultBlockData *p = _road_default_block_data[rule]->data;
|
|
|
3060 |
while (p->mode != 1) p++;
|
|
|
3061 |
*dir = p->attr;
|
|
|
3062 |
return TILE_ADD(tile, p->tileoffs);
|
|
|
3063 |
}
|
|
|
3064 |
|
|
|
3065 |
|
|
|
3066 |
static void AiStateBuildRoad(Player *p)
|
|
|
3067 |
{
|
|
|
3068 |
int num;
|
|
|
3069 |
AiBuildRec *aib;
|
|
|
3070 |
byte cmd;
|
|
|
3071 |
TileIndex tile;
|
|
|
3072 |
int dir;
|
|
|
3073 |
|
|
|
3074 |
// time out?
|
|
|
3075 |
if (++p->ai.timeout_counter == 1388) {
|
|
|
3076 |
p->ai.state = AIS_DELETE_ROAD_BLOCKS;
|
|
|
3077 |
return;
|
|
|
3078 |
}
|
|
|
3079 |
|
|
|
3080 |
// Currently building a road between two points?
|
|
|
3081 |
if (p->ai.state_mode != 255) {
|
|
|
3082 |
AiBuildRoad(p);
|
|
|
3083 |
|
|
|
3084 |
// Alternate between edges
|
|
|
3085 |
swap_tile(&p->ai.start_tile_a, &p->ai.start_tile_b);
|
|
|
3086 |
swap_tile(&p->ai.cur_tile_a, &p->ai.cur_tile_b);
|
|
|
3087 |
swap_byte(&p->ai.start_dir_a, &p->ai.start_dir_b);
|
|
|
3088 |
swap_byte(&p->ai.cur_dir_a, &p->ai.cur_dir_b);
|
|
|
3089 |
|
|
|
3090 |
sw ^= 1;
|
|
|
3091 |
return;
|
|
|
3092 |
}
|
|
|
3093 |
|
|
|
3094 |
// Now, find two new points to build between
|
|
|
3095 |
num = p->ai.num_build_rec;
|
|
|
3096 |
aib = &p->ai.src;
|
|
|
3097 |
|
|
|
3098 |
for(;;) {
|
|
|
3099 |
cmd = aib->buildcmd_a;
|
|
|
3100 |
aib->buildcmd_a = 255;
|
|
|
3101 |
if (cmd != 255) break;
|
|
|
3102 |
|
|
|
3103 |
aib++;
|
|
|
3104 |
if (--num == 0) {
|
|
|
3105 |
p->ai.state = AIS_BUILD_ROAD_VEHICLES;
|
|
|
3106 |
return;
|
|
|
3107 |
}
|
|
|
3108 |
}
|
|
|
3109 |
|
|
|
3110 |
// Find first edge to build from.
|
|
|
3111 |
tile = AiGetRoadBlockEdge(aib->cur_building_rule, aib->use_tile, &dir);
|
|
|
3112 |
p->ai.start_tile_a = tile;
|
|
|
3113 |
p->ai.cur_tile_a = tile;
|
|
|
3114 |
p->ai.start_dir_a = dir;
|
|
|
3115 |
p->ai.cur_dir_a = dir;
|
|
|
3116 |
|
|
|
3117 |
// Find second edge to build to
|
|
|
3118 |
aib = (&p->ai.src) + (cmd&0xF);
|
|
|
3119 |
tile = AiGetRoadBlockEdge(aib->cur_building_rule, aib->use_tile, &dir);
|
|
|
3120 |
p->ai.start_tile_b = tile;
|
|
|
3121 |
p->ai.cur_tile_b = tile;
|
|
|
3122 |
p->ai.start_dir_b = dir;
|
|
|
3123 |
p->ai.cur_dir_b = dir;
|
|
|
3124 |
|
|
|
3125 |
// And setup state.
|
|
|
3126 |
p->ai.state_mode = 2;
|
|
|
3127 |
p->ai.state_counter = 0;
|
|
|
3128 |
p->ai.banned_tile_count = 0;
|
|
|
3129 |
}
|
|
|
3130 |
|
|
|
3131 |
static int AiGetStationIdFromRoadBlock(TileIndex tile, int id)
|
|
|
3132 |
{
|
|
|
3133 |
const AiDefaultBlockData *p = _road_default_block_data[id]->data;
|
|
|
3134 |
while (p->mode != 1) p++;
|
|
|
3135 |
return _map2[TILE_ADD(tile, p->tileoffs)];
|
|
|
3136 |
}
|
|
|
3137 |
|
|
|
3138 |
static void AiStateBuildRoadVehicles(Player *p)
|
|
|
3139 |
{
|
|
|
3140 |
const AiDefaultBlockData *ptr;
|
|
|
3141 |
uint tile,loco_id;
|
|
|
3142 |
int veh, i;
|
|
|
3143 |
int32 cost;
|
|
|
3144 |
|
|
|
3145 |
ptr = _road_default_block_data[p->ai.src.cur_building_rule]->data;
|
|
|
3146 |
for(;ptr->mode != 0;ptr++) {}
|
|
|
3147 |
tile = TILE_ADD(p->ai.src.use_tile, ptr->tileoffs);
|
|
|
3148 |
|
|
|
3149 |
veh = AiChooseRoadVehToBuild(p->ai.cargo_type, p->player_money);
|
|
|
3150 |
if (veh == -1) {
|
|
|
3151 |
p->ai.state = AIS_0;
|
|
|
3152 |
return;
|
|
|
3153 |
}
|
|
|
3154 |
|
|
|
3155 |
cost = DoCommandByTile(tile, veh, 0, DC_EXEC, CMD_BUILD_ROAD_VEH);
|
|
|
3156 |
if (cost == CMD_ERROR)
|
|
|
3157 |
return;
|
|
|
3158 |
|
|
|
3159 |
loco_id = _new_roadveh_id;
|
|
|
3160 |
|
|
|
3161 |
for(i=0; p->ai.order_list_blocks[i] != 0xFF; i++) {
|
|
|
3162 |
AiBuildRec *aib = (&p->ai.src) + p->ai.order_list_blocks[i];
|
|
|
3163 |
uint flags = (AiGetStationIdFromRoadBlock(aib->use_tile, aib->cur_building_rule) << 8) + OT_GOTO_STATION;
|
|
|
3164 |
bool is_pass = (p->ai.cargo_type == CT_PASSENGERS ||
|
|
|
3165 |
p->ai.cargo_type == CT_MAIL ||
|
|
|
3166 |
(_opt.landscape==LT_NORMAL && p->ai.cargo_type == CT_VALUABLES));
|
|
|
3167 |
|
|
|
3168 |
if (!is_pass && i == 1) flags |= OF_UNLOAD;
|
|
|
3169 |
if (p->ai.num_want_fullload != 0 && (is_pass || i == 0)) flags |= OF_FULL_LOAD;
|
|
|
3170 |
|
|
|
3171 |
DoCommandByTile(0, loco_id + (i << 16), flags, DC_EXEC, CMD_INSERT_ORDER);
|
|
|
3172 |
}
|
|
|
3173 |
|
|
|
3174 |
DoCommandByTile(0, loco_id, 0, DC_EXEC, CMD_START_STOP_ROADVEH);
|
|
|
3175 |
|
|
|
3176 |
if (p->ai.num_want_fullload != 0)
|
|
|
3177 |
p->ai.num_want_fullload--;
|
|
|
3178 |
|
|
|
3179 |
if (--p->ai.num_loco_to_build == 0) {
|
|
|
3180 |
p->ai.state = AIS_0;
|
|
|
3181 |
}
|
|
|
3182 |
}
|
|
|
3183 |
|
|
|
3184 |
static void AiStateDeleteRoadBlocks(Player *p)
|
|
|
3185 |
{
|
|
|
3186 |
int num;
|
|
|
3187 |
AiBuildRec *aib;
|
|
|
3188 |
const AiDefaultBlockData *b;
|
|
|
3189 |
|
|
|
3190 |
num = p->ai.num_build_rec;
|
|
|
3191 |
aib = &p->ai.src;
|
|
|
3192 |
do {
|
|
|
3193 |
if (aib->cur_building_rule != 255) {
|
|
|
3194 |
b = _road_default_block_data[aib->cur_building_rule]->data;
|
|
|
3195 |
while (b->mode != 4) {
|
|
|
3196 |
if (b->mode <= 1) {
|
|
|
3197 |
DoCommandByTile(TILE_ADD(aib->use_tile, b->tileoffs), 0, 0, DC_EXEC, CMD_LANDSCAPE_CLEAR);
|
|
|
3198 |
}
|
|
|
3199 |
b++;
|
|
|
3200 |
}
|
|
|
3201 |
}
|
|
|
3202 |
} while (++aib,--num);
|
|
|
3203 |
|
|
|
3204 |
p->ai.state = AIS_0;
|
|
|
3205 |
}
|
|
|
3206 |
|
|
|
3207 |
static bool AiCheckIfHangar(Station *st)
|
|
|
3208 |
{
|
|
|
3209 |
uint tile = st->airport_tile;
|
|
|
3210 |
// HANGAR of airports
|
|
|
3211 |
// 0x20 - hangar large airport (32)
|
|
|
3212 |
// 0x41 - hangar small airport (65)
|
|
|
3213 |
return (_map5[tile] == 32 || _map5[tile] == 65);
|
|
|
3214 |
}
|
|
|
3215 |
|
|
|
3216 |
static void AiStateAirportStuff(Player *p)
|
|
|
3217 |
{
|
|
|
3218 |
Station *st;
|
|
|
3219 |
byte acc_planes;
|
|
|
3220 |
int i;
|
|
|
3221 |
AiBuildRec *aib;
|
|
|
3222 |
byte rule;
|
|
|
3223 |
|
|
|
3224 |
// Here we look for an airport we could use instead of building a new
|
|
|
3225 |
// one. If we find such an aiport for any waypoint,
|
|
|
3226 |
// AiStateBuildDefaultAirportBlocks() will kindly skip that one when
|
|
|
3227 |
// building the waypoints.
|
|
|
3228 |
|
|
|
3229 |
i = 0;
|
|
|
3230 |
do {
|
|
|
3231 |
// We do this all twice - once for the source (town in the case
|
|
|
3232 |
// of oilrig route) and then for the destination (oilrig in the
|
|
|
3233 |
// case of oilrig route).
|
|
|
3234 |
aib = &p->ai.src + i;
|
|
|
3235 |
|
|
|
3236 |
FOR_ALL_STATIONS(st) {
|
|
|
3237 |
// Dismiss ghost stations.
|
|
|
3238 |
if (st->xy == 0)
|
|
|
3239 |
continue;
|
|
|
3240 |
|
|
|
3241 |
// Is this an airport?
|
|
|
3242 |
if (!(st->facilities & FACIL_AIRPORT))
|
|
|
3243 |
continue;
|
|
|
3244 |
|
|
|
3245 |
// Do we own the airport? (Oilrigs aren't owned, though.)
|
|
|
3246 |
if (st->owner != OWNER_NONE && st->owner != _current_player)
|
|
|
3247 |
continue;
|
|
|
3248 |
|
|
|
3249 |
acc_planes = GetAirport(st->airport_type)->acc_planes;
|
|
|
3250 |
|
|
|
3251 |
// Dismiss heliports, unless we are checking an oilrig.
|
|
|
3252 |
if (acc_planes == HELICOPTERS_ONLY && !(p->ai.build_kind == 1 && i == 1))
|
|
|
3253 |
continue;
|
|
|
3254 |
|
|
|
3255 |
// Dismiss country airports if we are doing the other
|
|
|
3256 |
// endpoint of an oilrig route.
|
|
|
3257 |
if (acc_planes == AIRCRAFT_ONLY && (p->ai.build_kind == 1 && i == 0))
|
|
|
3258 |
continue;
|
|
|
3259 |
|
|
|
3260 |
// Dismiss airports too far away.
|
|
|
3261 |
if (GetTileDist1D(st->airport_tile, aib->spec_tile) > aib->rand_rng)
|
|
|
3262 |
continue;
|
|
|
3263 |
|
|
|
3264 |
// It's ideal airport, let's take it!
|
|
|
3265 |
|
|
|
3266 |
/* XXX: This part is utterly broken - rule should
|
|
|
3267 |
* contain number of the rule appropriate for the
|
|
|
3268 |
* airport type (country, town, ...), see
|
|
|
3269 |
* _airport_default_block_data (rule is just an index
|
|
|
3270 |
* in this array). But the only difference between the
|
|
|
3271 |
* currently existing two rules (rule 0 - town and rule
|
|
|
3272 |
* 1 - country) is the attr field which is used only
|
|
|
3273 |
* when building new airports - and that's irrelevant
|
|
|
3274 |
* for us. So using just about any rule will suffice
|
|
|
3275 |
* here for now (some of the new airport types would be
|
|
|
3276 |
* broken because they will probably need different
|
|
|
3277 |
* tileoff values etc), no matter that
|
|
|
3278 |
* AiCheckIfHangar() makes no sense. --pasky */
|
|
|
3279 |
if (acc_planes == HELICOPTERS_ONLY) {
|
|
|
3280 |
/* Heliports should have maybe own rulesets but
|
|
|
3281 |
* OTOH we don't want AI to pick them up when
|
|
|
3282 |
* looking for a suitable airport type to build.
|
|
|
3283 |
* So any of rules 0 or 1 would do for now. The
|
|
|
3284 |
* original rule number was 2 but that's a bug
|
|
|
3285 |
* because we have no such rule. */
|
|
|
3286 |
rule = 1;
|
|
|
3287 |
} else {
|
|
|
3288 |
rule = AiCheckIfHangar(st);
|
|
|
3289 |
}
|
|
|
3290 |
|
|
|
3291 |
aib->cur_building_rule = rule;
|
|
|
3292 |
aib->use_tile = st->airport_tile;
|
|
|
3293 |
break;
|
|
|
3294 |
}
|
|
|
3295 |
} while (++i != p->ai.num_build_rec);
|
|
|
3296 |
|
|
|
3297 |
p->ai.state = AIS_BUILD_DEFAULT_AIRPORT_BLOCKS;
|
|
|
3298 |
p->ai.state_mode = 255;
|
|
|
3299 |
p->ai.state_counter = 0;
|
|
|
3300 |
}
|
|
|
3301 |
|
|
|
3302 |
static int32 AiDoBuildDefaultAirportBlock(TileIndex tile, const AiDefaultBlockData *p, byte flag)
|
|
|
3303 |
{
|
|
|
3304 |
int32 total_cost = 0, r;
|
|
|
3305 |
|
|
|
3306 |
for(;p->mode == 0;p++) {
|
|
|
3307 |
if (!HASBIT(_avail_aircraft, p->attr))
|
|
|
3308 |
return CMD_ERROR;
|
|
|
3309 |
r = DoCommandByTile(TILE_MASK(tile + p->tileoffs), p->attr,0,flag | DC_AUTO | DC_NO_WATER,CMD_BUILD_AIRPORT);
|
|
|
3310 |
if (r == CMD_ERROR)
|
|
|
3311 |
return CMD_ERROR;
|
|
|
3312 |
total_cost += r;
|
|
|
3313 |
}
|
|
|
3314 |
|
|
|
3315 |
return total_cost;
|
|
|
3316 |
}
|
|
|
3317 |
|
|
|
3318 |
static bool AiCheckAirportResources(TileIndex tile, const AiDefaultBlockData *p, byte cargo)
|
|
|
3319 |
{
|
|
|
3320 |
uint values[NUM_CARGO];
|
|
|
3321 |
int w,h;
|
|
|
3322 |
uint tile2;
|
|
|
3323 |
|
|
|
3324 |
for(;p->mode==0;p++) {
|
|
|
3325 |
tile2 = TILE_ADD(tile, p->tileoffs);
|
|
|
3326 |
w = _airport_size_x[p->attr];
|
|
|
3327 |
h = _airport_size_y[p->attr];
|
|
|
3328 |
if (cargo & 0x80) {
|
|
|
3329 |
GetProductionAroundTiles(values, tile2, w, h);
|
|
|
3330 |
return values[cargo & 0x7F] != 0;
|
|
|
3331 |
} else {
|
|
|
3332 |
GetAcceptanceAroundTiles(values, tile2, w, h);
|
|
|
3333 |
return values[cargo] >= 8;
|
|
|
3334 |
}
|
|
|
3335 |
}
|
|
|
3336 |
return true;
|
|
|
3337 |
}
|
|
|
3338 |
|
|
|
3339 |
static int AiFindBestDefaultAirportBlock(TileIndex tile, byte cargo, byte heli, int32 *cost)
|
|
|
3340 |
{
|
|
|
3341 |
int i;
|
|
|
3342 |
const AiDefaultBlockData *p;
|
|
|
3343 |
for(i=0; (p = _airport_default_block_data[i]) != NULL; i++) {
|
|
|
3344 |
// If we are doing a helicopter service, avoid building
|
|
|
3345 |
// airports where they can't land.
|
|
|
3346 |
if (heli && GetAirport(p->attr)->acc_planes == AIRCRAFT_ONLY)
|
|
|
3347 |
continue;
|
|
|
3348 |
|
|
|
3349 |
*cost = AiDoBuildDefaultAirportBlock(tile, p, 0);
|
|
|
3350 |
if (*cost != CMD_ERROR && AiCheckAirportResources(tile, p, cargo))
|
|
|
3351 |
return i;
|
|
|
3352 |
}
|
|
|
3353 |
return -1;
|
|
|
3354 |
}
|
|
|
3355 |
|
|
|
3356 |
static void AiStateBuildDefaultAirportBlocks(Player *p)
|
|
|
3357 |
{
|
|
|
3358 |
int i, j;
|
|
|
3359 |
AiBuildRec *aib;
|
|
|
3360 |
int rule;
|
|
|
3361 |
int32 cost;
|
|
|
3362 |
|
|
|
3363 |
// time out?
|
|
|
3364 |
if (++p->ai.timeout_counter == 1388) {
|
|
|
3365 |
p->ai.state = AIS_0;
|
|
|
3366 |
return;
|
|
|
3367 |
}
|
|
|
3368 |
|
|
|
3369 |
// do the following 8 times
|
|
|
3370 |
i = 8;
|
|
|
3371 |
do {
|
|
|
3372 |
// check if we can build the default
|
|
|
3373 |
aib = &p->ai.src;
|
|
|
3374 |
j = p->ai.num_build_rec;
|
|
|
3375 |
do {
|
|
|
3376 |
// this item has already been built?
|
|
|
3377 |
if (aib->cur_building_rule != 255)
|
|
|
3378 |
continue;
|
|
|
3379 |
|
|
|
3380 |
// adjust the coordinate randomly,
|
|
|
3381 |
// to make sure that we find a position.
|
|
|
3382 |
aib->use_tile = AdjustTileCoordRandomly(aib->spec_tile, aib->rand_rng);
|
|
|
3383 |
|
|
|
3384 |
// check if the aircraft stuff can be built there.
|
|
|
3385 |
rule = AiFindBestDefaultAirportBlock(aib->use_tile, aib->cargo, p->ai.build_kind, &cost);
|
|
|
3386 |
|
|
|
3387 |
#if 0
|
|
|
3388 |
if (!IS_TILETYPE(aib->use_tile, MP_STREET) &&
|
|
|
3389 |
!IS_TILETYPE(aib->use_tile, MP_RAILWAY) &&
|
|
|
3390 |
!IS_TILETYPE(aib->use_tile, MP_STATION)
|
|
|
3391 |
) {
|
|
|
3392 |
|
|
|
3393 |
_map_type_and_height[aib->use_tile] = 0xa1;
|
|
|
3394 |
_map5[aib->use_tile] = 0x80;
|
|
|
3395 |
MarkTileDirtyByTile(aib->use_tile);
|
|
|
3396 |
}
|
|
|
3397 |
#endif
|
|
|
3398 |
// redsq_debug(aib->use_tile);
|
|
|
3399 |
|
|
|
3400 |
if (rule == -1) {
|
|
|
3401 |
// cannot build, terraform after a while
|
|
|
3402 |
if (p->ai.state_counter >= 600) {
|
|
|
3403 |
AiDoTerraformLand(aib->use_tile, Random()&3, 3, (int8)p->ai.state_mode);
|
|
|
3404 |
}
|
|
|
3405 |
// also try the other terraform direction
|
|
|
3406 |
if (++p->ai.state_counter >= 1000) {
|
|
|
3407 |
p->ai.state_counter = 0;
|
|
|
3408 |
p->ai.state_mode = -p->ai.state_mode;
|
|
|
3409 |
}
|
|
|
3410 |
} else if (CheckPlayerHasMoney(cost) && AiCheckBlockDistances(p,aib->use_tile)) {
|
|
|
3411 |
// player has money, build it.
|
|
|
3412 |
int32 r;
|
|
|
3413 |
|
|
|
3414 |
aib->cur_building_rule = rule;
|
|
|
3415 |
|
|
|
3416 |
r = AiDoBuildDefaultAirportBlock(
|
|
|
3417 |
aib->use_tile,
|
|
|
3418 |
_airport_default_block_data[rule],
|
|
|
3419 |
DC_EXEC | DC_NO_TOWN_RATING
|
|
|
3420 |
);
|
|
|
3421 |
assert(r != CMD_ERROR);
|
|
|
3422 |
}
|
|
|
3423 |
} while (++aib,--j);
|
|
|
3424 |
} while (--i);
|
|
|
3425 |
|
|
|
3426 |
// check if we're done with all of them
|
|
|
3427 |
aib = &p->ai.src;
|
|
|
3428 |
j = p->ai.num_build_rec;
|
|
|
3429 |
do {
|
|
|
3430 |
if (aib->cur_building_rule == 255)
|
|
|
3431 |
return;
|
|
|
3432 |
} while (++aib,--j);
|
|
|
3433 |
|
|
|
3434 |
// yep, all are done. switch state.
|
|
|
3435 |
p->ai.state = AIS_BUILD_AIRCRAFT_VEHICLES;
|
|
|
3436 |
}
|
|
|
3437 |
|
|
|
3438 |
static int AiGetStationIdFromAircraftBlock(TileIndex tile, int id)
|
|
|
3439 |
{
|
|
|
3440 |
const AiDefaultBlockData *p = _airport_default_block_data[id];
|
|
|
3441 |
while (p->mode != 1) p++;
|
|
|
3442 |
return _map2[TILE_ADD(tile, p->tileoffs)];
|
|
|
3443 |
}
|
|
|
3444 |
|
|
|
3445 |
static void AiStateBuildAircraftVehicles(Player *p)
|
|
|
3446 |
{
|
|
|
3447 |
const AiDefaultBlockData *ptr;
|
|
|
3448 |
uint tile;
|
|
|
3449 |
int veh;
|
|
|
3450 |
int32 cost;
|
|
|
3451 |
int i;
|
|
|
3452 |
uint loco_id;
|
|
|
3453 |
|
|
|
3454 |
ptr = _airport_default_block_data[p->ai.src.cur_building_rule];
|
|
|
3455 |
for(;ptr->mode!=0;ptr++) {}
|
|
|
3456 |
|
|
|
3457 |
tile = TILE_ADD(p->ai.src.use_tile, ptr->tileoffs);
|
|
|
3458 |
|
|
|
3459 |
veh = AiChooseAircraftToBuild(p->player_money, p->ai.build_kind!=0 ? 1 : 0);
|
|
|
3460 |
if (veh == -1) {
|
|
|
3461 |
return;
|
|
|
3462 |
}
|
|
|
3463 |
|
|
|
3464 |
cost = DoCommandByTile(tile, veh, 0, DC_EXEC, CMD_BUILD_AIRCRAFT);
|
|
|
3465 |
if (cost == CMD_ERROR)
|
|
|
3466 |
return;
|
|
|
3467 |
loco_id = _new_aircraft_id;
|
|
|
3468 |
|
|
|
3469 |
for(i=0; p->ai.order_list_blocks[i] != 0xFF; i++) {
|
|
|
3470 |
AiBuildRec *aib = (&p->ai.src) + p->ai.order_list_blocks[i];
|
|
|
3471 |
uint flags = (AiGetStationIdFromAircraftBlock(aib->use_tile, aib->cur_building_rule) << 8) + OT_GOTO_STATION;
|
|
|
3472 |
bool is_pass = (p->ai.cargo_type == CT_PASSENGERS || p->ai.cargo_type == CT_MAIL);
|
|
|
3473 |
|
|
|
3474 |
if (!is_pass && i == 1) flags |= OF_UNLOAD;
|
|
|
3475 |
if (p->ai.num_want_fullload != 0 && (is_pass || i == 0)) flags |= OF_FULL_LOAD;
|
|
|
3476 |
|
|
|
3477 |
DoCommandByTile(0, loco_id + (i << 16), flags, DC_EXEC, CMD_INSERT_ORDER);
|
|
|
3478 |
}
|
|
|
3479 |
|
|
|
3480 |
DoCommandByTile(0, loco_id, 0, DC_EXEC, CMD_START_STOP_AIRCRAFT);
|
|
|
3481 |
|
|
|
3482 |
if (p->ai.num_want_fullload != 0)
|
|
|
3483 |
p->ai.num_want_fullload--;
|
|
|
3484 |
|
|
|
3485 |
if (--p->ai.num_loco_to_build == 0) {
|
|
|
3486 |
p->ai.state = AIS_0;
|
|
|
3487 |
}
|
|
|
3488 |
}
|
|
|
3489 |
|
|
|
3490 |
static void AiStateCheckShipStuff(Player *p)
|
|
|
3491 |
{
|
|
|
3492 |
// XXX
|
|
|
3493 |
error("!AiStateCheckShipStuff");
|
|
|
3494 |
}
|
|
|
3495 |
|
|
|
3496 |
static void AiStateBuildDefaultShipBlocks(Player *p)
|
|
|
3497 |
{
|
|
|
3498 |
// XXX
|
|
|
3499 |
error("!AiStateBuildDefaultShipBlocks");
|
|
|
3500 |
}
|
|
|
3501 |
|
|
|
3502 |
static void AiStateDoShipStuff(Player *p)
|
|
|
3503 |
{
|
|
|
3504 |
// XXX
|
|
|
3505 |
error("!AiStateDoShipStuff");
|
|
|
3506 |
}
|
|
|
3507 |
|
|
|
3508 |
static void AiStateSellVeh(Player *p)
|
|
|
3509 |
{
|
|
|
3510 |
Vehicle *v = p->ai.cur_veh;
|
|
|
3511 |
|
|
|
3512 |
if (v->owner == _current_player) {
|
|
|
3513 |
if (v->type == VEH_Train) {
|
|
|
3514 |
|
|
|
3515 |
if (!IsTrainDepotTile(v->tile) || v->u.rail.track != 0x80 || !(v->vehstatus&VS_STOPPED)) {
|
|
|
3516 |
if ((v->next_order & OT_MASK) != OT_GOTO_DEPOT)
|
|
|
3517 |
DoCommandByTile(0, v->index, 0, DC_EXEC, CMD_TRAIN_GOTO_DEPOT);
|
|
|
3518 |
goto going_to_depot;
|
|
|
3519 |
}
|
|
|
3520 |
|
|
|
3521 |
// Sell whole train
|
|
|
3522 |
DoCommandByTile(v->tile, v->index, 1, DC_EXEC, CMD_SELL_RAIL_WAGON);
|
|
|
3523 |
|
|
|
3524 |
} else if (v->type == VEH_Road) {
|
|
|
3525 |
if (!IsRoadDepotTile(v->tile) || v->u.road.state != 254 || !(v->vehstatus&VS_STOPPED)) {
|
|
|
3526 |
if ((v->next_order & OT_MASK) != OT_GOTO_DEPOT)
|
|
|
3527 |
DoCommandByTile(0, v->index, 0, DC_EXEC, CMD_SEND_ROADVEH_TO_DEPOT);
|
|
|
3528 |
goto going_to_depot;
|
|
|
3529 |
}
|
|
|
3530 |
|
|
|
3531 |
DoCommandByTile(0, v->index, 0, DC_EXEC, CMD_SELL_ROAD_VEH);
|
|
|
3532 |
} else if (v->type == VEH_Aircraft) {
|
|
|
3533 |
if (!IsAircraftHangarTile(v->tile) && !(v->vehstatus&VS_STOPPED)) {
|
|
|
3534 |
if ((v->next_order & OT_MASK) != OT_GOTO_DEPOT)
|
|
|
3535 |
DoCommandByTile(0, v->index, 0, DC_EXEC, CMD_SEND_AIRCRAFT_TO_HANGAR);
|
|
|
3536 |
goto going_to_depot;
|
|
|
3537 |
}
|
|
|
3538 |
|
|
|
3539 |
DoCommandByTile(0, v->index, 0, DC_EXEC, CMD_SELL_AIRCRAFT);
|
|
|
3540 |
} else if (v->type == VEH_Ship) {
|
|
|
3541 |
// XXX: not implemented
|
|
|
3542 |
error("!v->type == VEH_Ship");
|
|
|
3543 |
}
|
|
|
3544 |
}
|
|
|
3545 |
|
|
|
3546 |
goto return_to_loop;
|
|
|
3547 |
going_to_depot:;
|
|
|
3548 |
if (++p->ai.state_counter <= 832)
|
|
|
3549 |
return;
|
|
|
3550 |
|
|
|
3551 |
if ((v->next_order&OT_MASK) == OT_GOTO_DEPOT) {
|
|
|
3552 |
v->next_order = OT_DUMMY;
|
|
|
3553 |
InvalidateWindow(WC_VEHICLE_VIEW, v->index);
|
|
|
3554 |
}
|
|
|
3555 |
return_to_loop:;
|
|
|
3556 |
p->ai.state = AIS_VEH_LOOP;
|
|
|
3557 |
}
|
|
|
3558 |
|
|
|
3559 |
static void AiStateRemoveStation(Player *p)
|
|
|
3560 |
{
|
|
|
3561 |
// Remove stations that aren't in use by any vehicle
|
|
|
3562 |
byte in_use[256], *used;
|
|
|
3563 |
uint16 *ord;
|
|
|
3564 |
Station *st;
|
|
|
3565 |
uint tile;
|
|
|
3566 |
|
|
|
3567 |
// Go to this state when we're done.
|
|
|
3568 |
p->ai.state = AIS_1;
|
|
|
3569 |
|
|
|
3570 |
// Get a list of all stations that are in use by a vehicle
|
|
|
3571 |
memset(in_use, 0, sizeof(in_use));
|
|
|
3572 |
for(ord=_order_array; ord != _ptr_to_next_order; ord++) {
|
|
|
3573 |
if ((*ord & OT_MASK) == OT_GOTO_STATION)
|
|
|
3574 |
in_use[*ord >> 8] = 1;
|
|
|
3575 |
}
|
|
|
3576 |
|
|
|
3577 |
// Go through all stations and delete those that aren't in use
|
|
|
3578 |
used=in_use;
|
|
|
3579 |
FOR_ALL_STATIONS(st) {
|
|
|
3580 |
if (st->xy != 0 && st->owner == _current_player && !*used &&
|
|
|
3581 |
((tile = st->bus_tile) != 0 ||
|
|
|
3582 |
(tile = st->lorry_tile) != 0 ||
|
|
|
3583 |
(tile = st->train_tile) != 0 ||
|
|
|
3584 |
(tile = st->dock_tile) != 0 ||
|
|
|
3585 |
(tile = st->airport_tile) != 0)) {
|
|
|
3586 |
DoCommandByTile(tile, 0, 0, DC_EXEC, CMD_LANDSCAPE_CLEAR);
|
|
|
3587 |
}
|
|
|
3588 |
used++;
|
|
|
3589 |
}
|
|
|
3590 |
|
|
|
3591 |
}
|
|
|
3592 |
|
|
|
3593 |
static void AiRemovePlayerRailOrRoad(Player *p, uint tile)
|
|
|
3594 |
{
|
|
|
3595 |
byte m5;
|
|
|
3596 |
|
|
|
3597 |
if (IS_TILETYPE(tile, MP_RAILWAY)) {
|
|
|
3598 |
if (_map_owner[tile] != _current_player)
|
|
|
3599 |
return;
|
|
|
3600 |
m5 = _map5[tile];
|
|
|
3601 |
if ((m5&~0x3) != 0xC0) {
|
|
|
3602 |
is_rail_crossing:;
|
|
|
3603 |
m5 = GetRailTrackStatus(tile);
|
|
|
3604 |
|
|
|
3605 |
if (m5 == 0xC || m5 == 0x30)
|
|
|
3606 |
return;
|
|
|
3607 |
|
|
|
3608 |
if (m5&0x25) {
|
|
|
3609 |
pos_0:
|
|
|
3610 |
if (!(GetRailTrackStatus(TILE_MASK(tile-TILE_XY(1,0)))&0x19)) {
|
|
|
3611 |
p->ai.cur_dir_a = 0;
|
|
|
3612 |
p->ai.cur_tile_a = tile;
|
|
|
3613 |
p->ai.state = AIS_REMOVE_SINGLE_RAIL_TILE;
|
|
|
3614 |
return;
|
|
|
3615 |
}
|
|
|
3616 |
}
|
|
|
3617 |
|
|
|
3618 |
if (m5&0x2A) {
|
|
|
3619 |
pos_1:
|
|
|
3620 |
if (!(GetRailTrackStatus(TILE_MASK(tile+TILE_XY(0,1)))&0x16)) {
|
|
|
3621 |
p->ai.cur_dir_a = 1;
|
|
|
3622 |
p->ai.cur_tile_a = tile;
|
|
|
3623 |
p->ai.state = AIS_REMOVE_SINGLE_RAIL_TILE;
|
|
|
3624 |
return;
|
|
|
3625 |
}
|
|
|
3626 |
}
|
|
|
3627 |
|
|
|
3628 |
if (m5&0x19) {
|
|
|
3629 |
pos_2:
|
|
|
3630 |
if (!(GetRailTrackStatus(TILE_MASK(tile+TILE_XY(1,0)))&0x25)) {
|
|
|
3631 |
p->ai.cur_dir_a = 2;
|
|
|
3632 |
p->ai.cur_tile_a = tile;
|
|
|
3633 |
p->ai.state = AIS_REMOVE_SINGLE_RAIL_TILE;
|
|
|
3634 |
return;
|
|
|
3635 |
}
|
|
|
3636 |
}
|
|
|
3637 |
|
|
|
3638 |
if (m5&0x16) {
|
|
|
3639 |
pos_3:
|
|
|
3640 |
if (!(GetRailTrackStatus(TILE_MASK(tile-TILE_XY(0,1)))&0x2A)) {
|
|
|
3641 |
p->ai.cur_dir_a = 3;
|
|
|
3642 |
p->ai.cur_tile_a = tile;
|
|
|
3643 |
p->ai.state = AIS_REMOVE_SINGLE_RAIL_TILE;
|
|
|
3644 |
return;
|
|
|
3645 |
}
|
|
|
3646 |
}
|
|
|
3647 |
} else {
|
|
|
3648 |
static const byte _depot_bits[] = {0x19,0x16,0x25,0x2A};
|
|
|
3649 |
|
|
|
3650 |
m5 &= 3;
|
|
|
3651 |
if (GetRailTrackStatus(tile + _tileoffs_by_dir[m5]) & _depot_bits[m5])
|
|
|
3652 |
return;
|
|
|
3653 |
|
|
|
3654 |
DoCommandByTile(tile, 0, 0, DC_EXEC, CMD_LANDSCAPE_CLEAR);
|
|
|
3655 |
}
|
|
|
3656 |
} else if (IS_TILETYPE(tile, MP_STREET)) {
|
|
|
3657 |
if (_map_owner[tile] != _current_player)
|
|
|
3658 |
return;
|
|
|
3659 |
|
|
|
3660 |
if ( (_map5[tile]&0xF0) == 0x10)
|
|
|
3661 |
goto is_rail_crossing;
|
|
|
3662 |
|
|
|
3663 |
if ( (_map5[tile]&0xF0) == 0x20) {
|
|
|
3664 |
int dir;
|
|
|
3665 |
|
|
|
3666 |
// Check if there are any stations around.
|
|
|
3667 |
if (IS_TILETYPE(tile + TILE_XY(-1,0), MP_STATION) &&
|
|
|
3668 |
_map_owner[tile + TILE_XY(-1,0)] == _current_player)
|
|
|
3669 |
return;
|
|
|
3670 |
|
|
|
3671 |
if (IS_TILETYPE(tile + TILE_XY(1,0), MP_STATION) &&
|
|
|
3672 |
_map_owner[tile + TILE_XY(1,0)] == _current_player)
|
|
|
3673 |
return;
|
|
|
3674 |
|
|
|
3675 |
if (IS_TILETYPE(tile + TILE_XY(0,-1), MP_STATION) &&
|
|
|
3676 |
_map_owner[tile + TILE_XY(0,-1)] == _current_player)
|
|
|
3677 |
return;
|
|
|
3678 |
|
|
|
3679 |
if (IS_TILETYPE(tile + TILE_XY(0,1), MP_STATION) &&
|
|
|
3680 |
_map_owner[tile + TILE_XY(0,1)] == _current_player)
|
|
|
3681 |
return;
|
|
|
3682 |
|
|
|
3683 |
dir = _map5[tile] & 3;
|
|
|
3684 |
|
|
|
3685 |
DoCommandByTile(tile, 0, 0, DC_EXEC, CMD_LANDSCAPE_CLEAR);
|
|
|
3686 |
DoCommandByTile(
|
|
|
3687 |
TILE_MASK(tile + _tileoffs_by_dir[dir]),
|
|
|
3688 |
8 >> (dir ^ 2),
|
|
|
3689 |
0,
|
|
|
3690 |
DC_EXEC,
|
|
|
3691 |
CMD_REMOVE_ROAD);
|
|
|
3692 |
}
|
|
|
3693 |
} else if (IS_TILETYPE(tile, MP_TUNNELBRIDGE)) {
|
|
|
3694 |
byte b;
|
|
|
3695 |
|
|
|
3696 |
if (_map_owner[tile] != _current_player || (_map5[tile] & 0xC6) != 0x80)
|
|
|
3697 |
return;
|
|
|
3698 |
|
|
|
3699 |
m5 = 0;
|
|
|
3700 |
|
|
|
3701 |
b = _map5[tile] & 0x21;
|
|
|
3702 |
if (b == 0) goto pos_0;
|
|
|
3703 |
if (b == 1) goto pos_3;
|
|
|
3704 |
if (b == 0x20) goto pos_2;
|
|
|
3705 |
goto pos_1;
|
|
|
3706 |
}
|
|
|
3707 |
}
|
|
|
3708 |
|
|
|
3709 |
static void AiStateRemoveTrack(Player *p)
|
|
|
3710 |
{
|
|
|
3711 |
int num = 1000;
|
|
|
3712 |
|
|
|
3713 |
do {
|
|
|
3714 |
uint tile = ++p->ai.state_counter;
|
|
|
3715 |
|
|
|
3716 |
// Iterated all tiles?
|
|
|
3717 |
if (tile == 0) {
|
|
|
3718 |
p->ai.state = AIS_REMOVE_STATION;
|
|
|
3719 |
return;
|
|
|
3720 |
}
|
|
|
3721 |
|
|
|
3722 |
// Remove player stuff in that tile
|
|
|
3723 |
AiRemovePlayerRailOrRoad(p, tile);
|
|
|
3724 |
if (p->ai.state != AIS_REMOVE_TRACK)
|
|
|
3725 |
return;
|
|
|
3726 |
} while (--num);
|
|
|
3727 |
}
|
|
|
3728 |
|
|
|
3729 |
static void AiStateRemoveSingleRailTile(Player *p)
|
|
|
3730 |
{
|
|
|
3731 |
// Remove until we can't remove more.
|
|
|
3732 |
if (!AiRemoveTileAndGoForward(p)) {
|
|
|
3733 |
p->ai.state = AIS_REMOVE_TRACK;
|
|
|
3734 |
}
|
|
|
3735 |
}
|
|
|
3736 |
|
|
|
3737 |
static AiStateAction * const _ai_actions[] = {
|
|
|
3738 |
AiCase0,
|
|
|
3739 |
AiCase1,
|
|
|
3740 |
AiStateVehLoop,
|
|
|
3741 |
AiStateCheckReplaceVehicle,
|
|
|
3742 |
AiStateDoReplaceVehicle,
|
|
|
3743 |
AiStateWantNewRoute,
|
|
|
3744 |
|
|
|
3745 |
AiStateBuildDefaultRailBlocks,
|
|
|
3746 |
AiStateBuildRail,
|
|
|
3747 |
AiStateBuildRailVeh,
|
|
|
3748 |
AiStateDeleteRailBlocks,
|
|
|
3749 |
|
|
|
3750 |
AiStateBuildDefaultRoadBlocks,
|
|
|
3751 |
AiStateBuildRoad,
|
|
|
3752 |
AiStateBuildRoadVehicles,
|
|
|
3753 |
AiStateDeleteRoadBlocks,
|
|
|
3754 |
|
|
|
3755 |
AiStateAirportStuff,
|
|
|
3756 |
AiStateBuildDefaultAirportBlocks,
|
|
|
3757 |
AiStateBuildAircraftVehicles,
|
|
|
3758 |
|
|
|
3759 |
AiStateCheckShipStuff,
|
|
|
3760 |
AiStateBuildDefaultShipBlocks,
|
|
|
3761 |
AiStateDoShipStuff,
|
|
|
3762 |
|
|
|
3763 |
AiStateSellVeh,
|
|
|
3764 |
AiStateRemoveStation,
|
|
|
3765 |
AiStateRemoveTrack,
|
|
|
3766 |
|
|
|
3767 |
AiStateRemoveSingleRailTile
|
|
|
3768 |
};
|
|
|
3769 |
|
|
|
3770 |
extern void ShowBuyCompanyDialog(uint player);
|
|
|
3771 |
|
|
|
3772 |
static void AiHandleTakeover(Player *p)
|
|
|
3773 |
{
|
|
|
3774 |
if (p->bankrupt_timeout != 0) {
|
|
|
3775 |
if ((p->bankrupt_timeout-=8) > 0)
|
|
|
3776 |
return;
|
|
|
3777 |
p->bankrupt_timeout = 0;
|
|
|
3778 |
DeleteWindowById(WC_BUY_COMPANY, _current_player);
|
|
|
3779 |
if (_current_player == _local_player) {
|
|
|
3780 |
AskExitToGameMenu();
|
|
|
3781 |
return;
|
|
|
3782 |
}
|
|
|
3783 |
if (IS_HUMAN_PLAYER(_current_player))
|
|
|
3784 |
return;
|
|
|
3785 |
}
|
|
|
3786 |
|
|
|
3787 |
if (p->bankrupt_asked == 255)
|
|
|
3788 |
return;
|
|
|
3789 |
|
|
|
3790 |
{
|
|
|
3791 |
uint asked = p->bankrupt_asked;
|
|
|
3792 |
Player *pp, *best_pl = NULL;
|
|
|
3793 |
int32 best_val = -1;
|
|
|
3794 |
uint old_p;
|
|
|
3795 |
|
|
|
3796 |
// Ask the guy with the highest performance hist.
|
|
|
3797 |
FOR_ALL_PLAYERS(pp) {
|
|
|
3798 |
if (pp->is_active &&
|
|
|
3799 |
!(asked&1) &&
|
|
|
3800 |
pp->bankrupt_asked == 0 &&
|
|
|
3801 |
best_val < pp->old_economy[1].performance_history) {
|
|
|
3802 |
best_val = pp->old_economy[1].performance_history;
|
|
|
3803 |
best_pl = pp;
|
|
|
3804 |
}
|
|
|
3805 |
asked>>=1;
|
|
|
3806 |
}
|
|
|
3807 |
|
|
|
3808 |
// Asked all players?
|
|
|
3809 |
if (best_val == -1) {
|
|
|
3810 |
p->bankrupt_asked = 255;
|
|
|
3811 |
return;
|
|
|
3812 |
}
|
|
|
3813 |
|
|
|
3814 |
SETBIT(p->bankrupt_asked, best_pl->index);
|
|
|
3815 |
|
|
|
3816 |
if (best_pl->index == _local_player) {
|
|
|
3817 |
p->bankrupt_timeout = 4440;
|
|
|
3818 |
ShowBuyCompanyDialog(_current_player);
|
|
|
3819 |
return;
|
|
|
3820 |
}
|
|
|
3821 |
if (IS_HUMAN_PLAYER(best_pl->index))
|
|
|
3822 |
return;
|
|
|
3823 |
|
|
|
3824 |
// Too little money for computer to buy it?
|
|
|
3825 |
if (best_pl->player_money >> 1 >= p->bankrupt_value) {
|
|
|
3826 |
// Computer wants to buy it.
|
|
|
3827 |
old_p = _current_player;
|
|
|
3828 |
_current_player = p->index;
|
|
|
3829 |
DoCommandByTile(0, old_p, 0, DC_EXEC, CMD_BUY_COMPANY);
|
|
|
3830 |
_current_player = old_p;
|
|
|
3831 |
}
|
|
|
3832 |
}
|
|
|
3833 |
}
|
|
|
3834 |
|
|
|
3835 |
static void AiAdjustLoan(Player *p)
|
|
|
3836 |
{
|
|
|
3837 |
int32 base = AiGetBasePrice(p);
|
|
|
3838 |
|
|
|
3839 |
if (p->player_money > base * 1400) {
|
|
|
3840 |
// Decrease loan
|
|
|
3841 |
if (p->current_loan != 0) {
|
|
|
3842 |
DoCommandByTile(0, _current_player, 0, DC_EXEC, CMD_DECREASE_LOAN);
|
|
|
3843 |
}
|
|
|
3844 |
} else if (p->player_money < base * 500) {
|
|
|
3845 |
// Increase loan
|
|
|
3846 |
if (p->current_loan < _economy.max_loan &&
|
|
|
3847 |
p->num_valid_stat_ent >= 2 &&
|
|
|
3848 |
-(p->old_economy[0].expenses+p->old_economy[1].expenses) < base * 60) {
|
|
|
3849 |
DoCommandByTile(0, _current_player, 0, DC_EXEC, CMD_INCREASE_LOAN);
|
|
|
3850 |
}
|
|
|
3851 |
}
|
|
|
3852 |
}
|
|
|
3853 |
|
|
|
3854 |
static void AiBuildCompanyHQ(Player *p)
|
|
|
3855 |
{
|
|
|
3856 |
TileIndex tile;
|
|
|
3857 |
|
|
|
3858 |
if (p->location_of_house == 0 &&
|
|
|
3859 |
p->last_build_coordinate != 0) {
|
|
|
3860 |
tile = AdjustTileCoordRandomly(p->last_build_coordinate, 8);
|
|
|
3861 |
DoCommandByTile(tile, 0, 0, DC_EXEC | DC_AUTO | DC_NO_WATER, CMD_BUILD_COMPANY_HQ);
|
|
|
3862 |
}
|
|
|
3863 |
}
|
|
|
3864 |
|
|
|
3865 |
|
|
|
3866 |
void AiDoGameLoop(Player *p)
|
|
|
3867 |
{
|
|
|
3868 |
_cur_ai_player = p;
|
|
|
3869 |
|
|
|
3870 |
if (p->bankrupt_asked != 0) {
|
|
|
3871 |
AiHandleTakeover(p);
|
|
|
3872 |
return;
|
|
|
3873 |
}
|
|
|
3874 |
|
|
|
3875 |
if (IS_HUMAN_PLAYER(_current_player))
|
|
|
3876 |
return;
|
|
|
3877 |
|
|
|
3878 |
AiAdjustLoan(p);
|
|
|
3879 |
AiBuildCompanyHQ(p);
|
|
|
3880 |
|
|
|
3881 |
if (_opt.diff.competitor_speed == 4) {
|
|
|
3882 |
/* ultraspeed */
|
|
|
3883 |
_ai_actions[p->ai.state](p);
|
|
|
3884 |
if (p->bankrupt_asked != 0)
|
|
|
3885 |
return;
|
|
|
3886 |
} else if (_opt.diff.competitor_speed != 3) {
|
|
|
3887 |
p->ai.tick++;
|
|
|
3888 |
if (!(p->ai.tick&1))
|
|
|
3889 |
return;
|
|
|
3890 |
if (_opt.diff.competitor_speed != 2) {
|
|
|
3891 |
if (!(p->ai.tick&2))
|
|
|
3892 |
return;
|
|
|
3893 |
if (_opt.diff.competitor_speed == 0) {
|
|
|
3894 |
if (!(p->ai.tick&4))
|
|
|
3895 |
return;
|
|
|
3896 |
}
|
|
|
3897 |
}
|
|
|
3898 |
}
|
|
|
3899 |
#if 0
|
|
|
3900 |
{
|
|
|
3901 |
static byte old_state = 99;
|
|
|
3902 |
static bool hasdots = false;
|
|
|
3903 |
char *_ai_state_names[]={
|
|
|
3904 |
"AiCase0",
|
|
|
3905 |
"AiCase1",
|
|
|
3906 |
"AiStateVehLoop",
|
|
|
3907 |
"AiStateCheckReplaceVehicle",
|
|
|
3908 |
"AiStateDoReplaceVehicle",
|
|
|
3909 |
"AiStateWantNewRoute",
|
|
|
3910 |
"AiStateBuildDefaultRailBlocks",
|
|
|
3911 |
"AiStateBuildRail",
|
|
|
3912 |
"AiStateBuildRailVeh",
|
|
|
3913 |
"AiStateDeleteRailBlocks",
|
|
|
3914 |
"AiStateBuildDefaultRoadBlocks",
|
|
|
3915 |
"AiStateBuildRoad",
|
|
|
3916 |
"AiStateBuildRoadVehicles",
|
|
|
3917 |
"AiStateDeleteRoadBlocks",
|
|
|
3918 |
"AiStateAirportStuff",
|
|
|
3919 |
"AiStateBuildDefaultAirportBlocks",
|
|
|
3920 |
"AiStateBuildAircraftVehicles",
|
|
|
3921 |
"AiStateCheckShipStuff",
|
|
|
3922 |
"AiStateBuildDefaultShipBlocks",
|
|
|
3923 |
"AiStateDoShipStuff",
|
|
|
3924 |
"AiStateSellVeh",
|
|
|
3925 |
"AiStateRemoveStation",
|
|
|
3926 |
"AiStateRemoveTrack",
|
|
|
3927 |
"AiStateRemoveSingleRailTile"
|
|
|
3928 |
};
|
|
|
3929 |
|
|
|
3930 |
if (p->ai.state != old_state) {
|
|
|
3931 |
if (hasdots)
|
|
|
3932 |
printf("\n");
|
|
|
3933 |
hasdots=false;
|
|
|
3934 |
printf("AiState: %s\n", _ai_state_names[old_state=p->ai.state]);
|
|
|
3935 |
} else {
|
|
|
3936 |
printf(".");
|
|
|
3937 |
hasdots=true;
|
|
|
3938 |
}
|
|
|
3939 |
}
|
|
|
3940 |
#endif
|
|
|
3941 |
|
|
|
3942 |
_ai_actions[p->ai.state](p);
|
|
|
3943 |
}
|