1 | {$INCLUDE Switches.inc}
|
---|
2 | unit CustomAI;
|
---|
3 |
|
---|
4 | interface
|
---|
5 |
|
---|
6 | uses
|
---|
7 | {$IFDEF DEBUG}SysUtils,{$ENDIF} // necessary for debug exceptions
|
---|
8 | Protocol;
|
---|
9 |
|
---|
10 | type
|
---|
11 | TNegoTime=(BeginOfTurn, EndOfTurn, EnemyCalled);
|
---|
12 |
|
---|
13 | TCustomAI=class
|
---|
14 | public
|
---|
15 | procedure Process(Command: integer; var Data);
|
---|
16 |
|
---|
17 | // overridables
|
---|
18 | constructor Create(Nation: integer); virtual;
|
---|
19 | destructor Destroy; override;
|
---|
20 | procedure SetDataDefaults; virtual;
|
---|
21 | procedure SetDataRandom; virtual;
|
---|
22 | procedure OnBeforeEnemyAttack(UnitInfo: TUnitInfo;
|
---|
23 | ToLoc, EndHealth, EndHealthDef: integer); virtual;
|
---|
24 | procedure OnBeforeEnemyCapture(UnitInfo: TUnitInfo; ToLoc: integer); virtual;
|
---|
25 | procedure OnAfterEnemyAttack; virtual;
|
---|
26 | procedure OnAfterEnemyCapture; virtual;
|
---|
27 |
|
---|
28 | protected
|
---|
29 | me: integer; // index of the controlled nation
|
---|
30 | RO: ^TPlayerContext;
|
---|
31 | Map: ^TTileList;
|
---|
32 | MyUnit: ^TUnList;
|
---|
33 | MyCity: ^TCityList;
|
---|
34 | MyModel: ^TModelList;
|
---|
35 |
|
---|
36 | cixStateImp: array[imPalace..imSpacePort] of integer;
|
---|
37 |
|
---|
38 | // negotiation
|
---|
39 | Opponent: integer; // nation i'm in negotiation with, -1 indicates no-negotiation mode
|
---|
40 | MyAction, MyLastAction, OppoAction: integer;
|
---|
41 | MyOffer, MyLastOffer, OppoOffer: TOffer;
|
---|
42 |
|
---|
43 | // overridables
|
---|
44 | procedure DoTurn; virtual;
|
---|
45 | procedure DoNegotiation; virtual;
|
---|
46 | function ChooseResearchAdvance: integer; virtual;
|
---|
47 | function ChooseStealAdvance: integer; virtual;
|
---|
48 | function ChooseGovernment: integer; virtual;
|
---|
49 | function WantNegotiation(Nation: integer; NegoTime: TNegoTime): boolean; virtual;
|
---|
50 | function OnNegoRejected_CancelTreaty: boolean; virtual;
|
---|
51 |
|
---|
52 | // general functions
|
---|
53 | function IsResearched(Advance: integer): boolean;
|
---|
54 | function ResearchCost: integer;
|
---|
55 | function ChangeAttitude(Nation, Attitude: integer): integer;
|
---|
56 | function Revolution: integer;
|
---|
57 | function ChangeRates(Tax,Lux: integer): integer;
|
---|
58 | function PrepareNewModel(Domain: integer): integer;
|
---|
59 | function SetNewModelFeature(F, Count: integer): integer;
|
---|
60 | function AdvanceResearchable(Advance: integer): boolean;
|
---|
61 | function AdvanceStealable(Advance: integer): boolean;
|
---|
62 | function GetJobProgress(Loc: integer; var JobProgress: TJobProgressData): boolean;
|
---|
63 | function DebugMessage(Level: integer; Text: string): boolean;
|
---|
64 | function SetDebugMap(var DebugMap): boolean;
|
---|
65 |
|
---|
66 | // unit functions
|
---|
67 | procedure Unit_FindMyDefender(Loc: integer; var uix: integer);
|
---|
68 | procedure Unit_FindEnemyDefender(Loc: integer; var euix: integer);
|
---|
69 | function Unit_Move(uix,ToLoc: integer): integer;
|
---|
70 | function Unit_Step(uix,ToLoc: integer): integer;
|
---|
71 | function Unit_Attack(uix,ToLoc: integer): integer;
|
---|
72 | function Unit_DoMission(uix,MissionType,ToLoc: integer): integer;
|
---|
73 | function Unit_MoveForecast(uix,ToLoc: integer; var RemainingMovement: integer): boolean;
|
---|
74 | function Unit_AttackForecast(uix,ToLoc,AttackMovement: integer; var RemainingHealth: integer): boolean;
|
---|
75 | function Unit_DefenseForecast(euix,ToLoc: integer; var RemainingHealth: integer): boolean;
|
---|
76 | function Unit_Disband(uix: integer): integer;
|
---|
77 | function Unit_StartJob(uix,NewJob: integer): integer;
|
---|
78 | function Unit_SetHomeHere(uix: integer): integer;
|
---|
79 | function Unit_Load(uix: integer): integer;
|
---|
80 | function Unit_Unload(uix: integer): integer;
|
---|
81 | function Unit_SelectTransport(uix: integer): integer;
|
---|
82 | function Unit_AddToCity(uix: integer): integer;
|
---|
83 |
|
---|
84 | // city functions
|
---|
85 | procedure City_FindMyCity(Loc: integer; var cix: integer);
|
---|
86 | procedure City_FindEnemyCity(Loc: integer; var ecix: integer);
|
---|
87 | function City_HasProject(cix: integer): boolean;
|
---|
88 | function City_CurrentImprovementProject(cix: integer): integer;
|
---|
89 | function City_CurrentUnitProject(cix: integer): integer;
|
---|
90 | function City_GetTileInfo(cix,TileLoc: integer; var TileInfo: TTileInfo): integer;
|
---|
91 | function City_GetReport(cix: integer; var Report: TCityReport): integer;
|
---|
92 | function City_GetHypoReport(cix, HypoTiles, HypoTax, HypoLux: integer; var Report: TCityReport): integer;
|
---|
93 | function City_GetReportNew(cix: integer; var Report: TCityReportNew): integer;
|
---|
94 | function City_GetHypoReportNew(cix, HypoTiles, HypoTaxRate, HypoLuxuryRate: integer; var Report: TCityReportNew): integer;
|
---|
95 | function City_GetAreaInfo(cix: integer; var AreaInfo: TCityAreaInfo): integer;
|
---|
96 | function City_StartUnitProduction(cix,mix: integer): integer;
|
---|
97 | function City_StartEmigration(cix,mix: integer; AllowDisbandCity, AsConscripts: boolean): integer;
|
---|
98 | function City_StartImprovement(cix,iix: integer): integer;
|
---|
99 | function City_Improvable(cix,iix: integer): boolean;
|
---|
100 | function City_StopProduction(cix: integer): integer;
|
---|
101 | function City_BuyProject(cix: integer): integer;
|
---|
102 | function City_SellImprovement(cix,iix: integer): integer;
|
---|
103 | function City_RebuildImprovement(cix,iix: integer): integer;
|
---|
104 | function City_SetTiles(cix,NewTiles: integer): integer;
|
---|
105 | procedure City_OptimizeTiles(cix: integer; ResourceWeights: cardinal = rwMaxGrowth);
|
---|
106 |
|
---|
107 | // negotiation
|
---|
108 | function Nego_CheckMyAction: integer;
|
---|
109 |
|
---|
110 | private
|
---|
111 | HaveTurned: boolean;
|
---|
112 | UnwantedNego: set of 0..nPl-1;
|
---|
113 | Contacted: set of 0..nPl-1;
|
---|
114 | procedure StealAdvance;
|
---|
115 | end;
|
---|
116 |
|
---|
117 |
|
---|
118 | var
|
---|
119 | Server: TServerCall;
|
---|
120 | G: TNewGameData;
|
---|
121 | RWDataSize, MapSize: integer;
|
---|
122 | decompose24: cardinal;
|
---|
123 | nodata: pointer;
|
---|
124 |
|
---|
125 | const
|
---|
126 | CityOwnTile = 13; // = ab_to_V21(0,0)
|
---|
127 |
|
---|
128 | // additional return codes
|
---|
129 | rLocationReached= $00010000; // Unit_Move: move was not interrupted, location reached
|
---|
130 | rMoreTurns= $00020000; // Unit_Move: move was not interrupted, location not reached yet
|
---|
131 |
|
---|
132 | type
|
---|
133 | TVicinity8Loc=array[0..7] of integer;
|
---|
134 | TVicinity21Loc=array[0..27] of integer;
|
---|
135 |
|
---|
136 |
|
---|
137 | procedure Init(NewGameData: TNewGameData);
|
---|
138 |
|
---|
139 | procedure ab_to_Loc(Loc0,a,b: integer; var Loc: integer);
|
---|
140 | procedure Loc_to_ab(Loc0,Loc: integer; var a,b: integer);
|
---|
141 | procedure ab_to_V8(a,b: integer; var V8: integer);
|
---|
142 | procedure V8_to_ab(V8: integer; var a,b: integer);
|
---|
143 | procedure ab_to_V21(a,b: integer; var V21: integer);
|
---|
144 | procedure V21_to_ab(V21: integer; var a,b: integer);
|
---|
145 | procedure V8_to_Loc(Loc0: integer; var VicinityLoc: TVicinity8Loc);
|
---|
146 | procedure V21_to_Loc(Loc0: integer; var VicinityLoc: TVicinity21Loc);
|
---|
147 | function Distance(Loc0,Loc1: integer): integer;
|
---|
148 |
|
---|
149 |
|
---|
150 | implementation
|
---|
151 |
|
---|
152 | const
|
---|
153 | ab_v8: array[-4..4] of integer = (5,6,7,4,-1,0,3,2,1);
|
---|
154 | v8_a: array[0..7] of integer = (1,1,0,-1,-1,-1,0,1);
|
---|
155 | v8_b: array[0..7] of integer = (0,1,1,1,0,-1,-1,-1);
|
---|
156 |
|
---|
157 |
|
---|
158 | procedure ab_to_Loc(Loc0,a,b: integer; var Loc: integer);
|
---|
159 | {relative location from Loc0}
|
---|
160 | var
|
---|
161 | y0: integer;
|
---|
162 | begin
|
---|
163 | assert((Loc0>=0) and (Loc0<MapSize) and (a-b+G.lx>=0));
|
---|
164 | y0:=cardinal(Loc0)*decompose24 shr 24;
|
---|
165 | Loc:=(Loc0+(a-b+y0 and 1+G.lx+G.lx) shr 1) mod G.lx +G.lx*(y0+a+b);
|
---|
166 | if Loc>=MapSize then Loc:=-$1000
|
---|
167 | end;
|
---|
168 |
|
---|
169 | procedure Loc_to_ab(Loc0,Loc: integer; var a,b: integer);
|
---|
170 | {$IFDEF FPC} // freepascal
|
---|
171 | var
|
---|
172 | dx,dy: integer;
|
---|
173 | begin
|
---|
174 | dx:=((Loc mod G.lx *2 +Loc div G.lx and 1)
|
---|
175 | -(Loc0 mod G.lx *2 +Loc0 div G.lx and 1)+3*G.lx) mod (2*G.lx) -G.lx;
|
---|
176 | dy:=Loc div G.lx-Loc0 div G.lx;
|
---|
177 | a:=(dx+dy) div 2;
|
---|
178 | b:=(dy-dx) div 2;
|
---|
179 | end;
|
---|
180 | {$ELSE} // delphi
|
---|
181 | register;
|
---|
182 | asm
|
---|
183 | push ebx
|
---|
184 |
|
---|
185 | // calculate
|
---|
186 | push ecx
|
---|
187 | div byte ptr [G]
|
---|
188 | xor ebx,ebx
|
---|
189 | mov bl,ah // ebx:=Loc0 mod G.lx
|
---|
190 | mov ecx,eax
|
---|
191 | and ecx,$000000FF // ecx:=Loc0 div G.lx
|
---|
192 | mov eax,edx
|
---|
193 | div byte ptr [G]
|
---|
194 | xor edx,edx
|
---|
195 | mov dl,ah // edx:=Loc mod G.lx
|
---|
196 | and eax,$000000FF // eax:=Loc div G.lx
|
---|
197 | sub edx,ebx // edx:=Loc mod G.lx-Loc0 mod G.lx
|
---|
198 | mov ebx,eax
|
---|
199 | sub ebx,ecx // ebx:=dy
|
---|
200 | and eax,1
|
---|
201 | and ecx,1
|
---|
202 | add edx,edx
|
---|
203 | add eax,edx
|
---|
204 | sub eax,ecx // eax:=dx, not normalized
|
---|
205 | pop ecx
|
---|
206 |
|
---|
207 | // normalize
|
---|
208 | mov edx,dword ptr [G]
|
---|
209 | cmp eax,edx
|
---|
210 | jl @a
|
---|
211 | sub eax,edx
|
---|
212 | sub eax,edx
|
---|
213 | jmp @ok
|
---|
214 | @a:
|
---|
215 | neg edx
|
---|
216 | cmp eax,edx
|
---|
217 | jnl @ok
|
---|
218 | sub eax,edx
|
---|
219 | sub eax,edx
|
---|
220 |
|
---|
221 | // return results
|
---|
222 | @ok:
|
---|
223 | mov edx,ebx
|
---|
224 | sub edx,eax
|
---|
225 | add eax,ebx
|
---|
226 | sar edx,1 // edx:=b
|
---|
227 | mov ebx,[b]
|
---|
228 | mov [ebx],edx
|
---|
229 | sar eax,1 // eax:=a
|
---|
230 | mov [a],eax
|
---|
231 |
|
---|
232 | pop ebx
|
---|
233 | end;
|
---|
234 | {$ENDIF}
|
---|
235 |
|
---|
236 | procedure ab_to_V8(a,b: integer; var V8: integer);
|
---|
237 | begin
|
---|
238 | assert((abs(a)<=1) and (abs(b)<=1) and ((a<>0) or (b<>0)));
|
---|
239 | V8:=ab_v8[2*b+b+a];
|
---|
240 | end;
|
---|
241 |
|
---|
242 | procedure V8_to_ab(V8: integer; var a,b: integer);
|
---|
243 | begin
|
---|
244 | a:=v8_a[V8]; b:=V8_b[V8];
|
---|
245 | end;
|
---|
246 |
|
---|
247 | procedure ab_to_V21(a,b: integer; var V21: integer);
|
---|
248 | begin
|
---|
249 | V21:=(a+b+3) shl 2+(a-b+3) shr 1;
|
---|
250 | end;
|
---|
251 |
|
---|
252 | procedure V21_to_ab(V21: integer; var a,b: integer);
|
---|
253 | var
|
---|
254 | dx,dy: integer;
|
---|
255 | begin
|
---|
256 | dy:=V21 shr 2-3;
|
---|
257 | dx:=V21 and 3 shl 1 -3 + (dy+3) and 1;
|
---|
258 | a:=(dx+dy) div 2;
|
---|
259 | b:=(dy-dx) div 2;
|
---|
260 | end;
|
---|
261 |
|
---|
262 | procedure V8_to_Loc(Loc0: integer; var VicinityLoc: TVicinity8Loc);
|
---|
263 | var
|
---|
264 | x0,y0,lx: integer;
|
---|
265 | begin
|
---|
266 | lx:=G.lx;
|
---|
267 | y0:=cardinal(Loc0)*decompose24 shr 24;
|
---|
268 | x0:=Loc0-y0*lx; // Loc0 mod lx;
|
---|
269 | VicinityLoc[1]:=Loc0+lx*2;
|
---|
270 | VicinityLoc[3]:=Loc0-1;
|
---|
271 | VicinityLoc[5]:=Loc0-lx*2;
|
---|
272 | VicinityLoc[7]:=Loc0+1;
|
---|
273 | inc(Loc0,y0 and 1);
|
---|
274 | VicinityLoc[0]:=Loc0+lx;
|
---|
275 | VicinityLoc[2]:=Loc0+lx-1;
|
---|
276 | VicinityLoc[4]:=Loc0-lx-1;
|
---|
277 | VicinityLoc[6]:=Loc0-lx;
|
---|
278 |
|
---|
279 | // world is round!
|
---|
280 | if x0<lx-1 then
|
---|
281 | begin
|
---|
282 | if x0=0 then
|
---|
283 | begin
|
---|
284 | inc(VicinityLoc[3],lx);
|
---|
285 | if y0 and 1=0 then
|
---|
286 | begin
|
---|
287 | inc(VicinityLoc[2],lx);
|
---|
288 | inc(VicinityLoc[4],lx);
|
---|
289 | end
|
---|
290 | end
|
---|
291 | end
|
---|
292 | else
|
---|
293 | begin
|
---|
294 | dec(VicinityLoc[7],lx);
|
---|
295 | if y0 and 1=1 then
|
---|
296 | begin
|
---|
297 | dec(VicinityLoc[0],lx);
|
---|
298 | dec(VicinityLoc[6],lx);
|
---|
299 | end
|
---|
300 | end;
|
---|
301 |
|
---|
302 | // check south pole
|
---|
303 | case G.ly-y0 of
|
---|
304 | 1:
|
---|
305 | begin
|
---|
306 | VicinityLoc[0]:=-$1000;
|
---|
307 | VicinityLoc[1]:=-$1000;
|
---|
308 | VicinityLoc[2]:=-$1000;
|
---|
309 | end;
|
---|
310 | 2: VicinityLoc[1]:=-$1000;
|
---|
311 | end
|
---|
312 | end;
|
---|
313 |
|
---|
314 | procedure V21_to_Loc(Loc0: integer; var VicinityLoc: TVicinity21Loc);
|
---|
315 | var
|
---|
316 | dx,dy,bit,y0,xComp,yComp,xComp0,xCompSwitch: integer;
|
---|
317 | dst: ^integer;
|
---|
318 | begin
|
---|
319 | y0:=cardinal(Loc0)*decompose24 shr 24;
|
---|
320 | xComp0:=Loc0-y0*G.lx-1; // Loc0 mod G.lx -1
|
---|
321 | xCompSwitch:=xComp0-1+y0 and 1;
|
---|
322 | if xComp0<0 then inc(xComp0,G.lx);
|
---|
323 | if xCompSwitch<0 then inc(xCompSwitch,G.lx);
|
---|
324 | xCompSwitch:=xCompSwitch xor xComp0;
|
---|
325 | yComp:=G.lx*(y0-3);
|
---|
326 | dst:=@VicinityLoc;
|
---|
327 | bit:=1;
|
---|
328 | for dy:=0 to 6 do
|
---|
329 | if yComp<MapSize then
|
---|
330 | begin
|
---|
331 | xComp0:=xComp0 xor xCompSwitch;
|
---|
332 | xComp:=xComp0;
|
---|
333 | for dx:=0 to 3 do
|
---|
334 | begin
|
---|
335 | if bit and $67F7F76<>0 then dst^:=xComp+yComp
|
---|
336 | else dst^:=-1;
|
---|
337 | inc(xComp);
|
---|
338 | if xComp>=G.lx then dec(xComp, G.lx);
|
---|
339 | inc(dst);
|
---|
340 | bit:=bit shl 1;
|
---|
341 | end;
|
---|
342 | inc(yComp,G.lx);
|
---|
343 | end
|
---|
344 | else
|
---|
345 | begin
|
---|
346 | for dx:=0 to 3 do
|
---|
347 | begin dst^:=-$1000; inc(dst); end;
|
---|
348 | end
|
---|
349 | end;
|
---|
350 |
|
---|
351 | function Distance(Loc0,Loc1: integer): integer;
|
---|
352 | var
|
---|
353 | a,b,dx,dy: integer;
|
---|
354 | begin
|
---|
355 | Loc_to_ab(Loc0,Loc1,a,b);
|
---|
356 | dx:=abs(a-b);
|
---|
357 | dy:=abs(a+b);
|
---|
358 | result:=dx+dy+abs(dx-dy) shr 1;
|
---|
359 | end;
|
---|
360 |
|
---|
361 |
|
---|
362 | procedure Init(NewGameData: TNewGameData);
|
---|
363 | {$IFDEF DEBUG}var Loc: integer;{$ENDIF}
|
---|
364 | begin
|
---|
365 | G:=NewGameData;
|
---|
366 | MapSize:=G.lx*G.ly;
|
---|
367 | decompose24:=(1 shl 24-1) div G.lx +1;
|
---|
368 | {$IFDEF DEBUG}for Loc:=0 to MapSize-1 do assert(cardinal(Loc)*decompose24 shr 24=cardinal(Loc div G.lx));{$ENDIF}
|
---|
369 | end;
|
---|
370 |
|
---|
371 |
|
---|
372 | constructor TCustomAI.Create(Nation: integer);
|
---|
373 | begin
|
---|
374 | inherited Create;
|
---|
375 | me:=Nation;
|
---|
376 | RO:=pointer(G.RO[Nation]);
|
---|
377 | Map:=pointer(RO.Map);
|
---|
378 | MyUnit:=pointer(RO.Un);
|
---|
379 | MyCity:=pointer(RO.City);
|
---|
380 | MyModel:=pointer(RO.Model);
|
---|
381 | Opponent:=-1;
|
---|
382 | end;
|
---|
383 |
|
---|
384 | destructor TCustomAI.Destroy;
|
---|
385 | begin
|
---|
386 | Server(sSetDebugMap,me,0,nodata^);
|
---|
387 | end;
|
---|
388 |
|
---|
389 |
|
---|
390 | procedure TCustomAI.Process(Command: integer; var Data);
|
---|
391 | var
|
---|
392 | Nation,NewResearch,NewGov,count,ad,cix,iix: integer;
|
---|
393 | NegoTime: TNegoTime;
|
---|
394 | begin
|
---|
395 | case Command of
|
---|
396 | cTurn, cContinue:
|
---|
397 | begin
|
---|
398 | if RO.Alive and (1 shl me)=0 then
|
---|
399 | begin // I'm dead, huhu
|
---|
400 | Server(sTurn,me,0,nodata^);
|
---|
401 | exit
|
---|
402 | end;
|
---|
403 | if Command=cTurn then
|
---|
404 | begin
|
---|
405 | fillchar(cixStateImp, sizeof(cixStateImp), $FF);
|
---|
406 | for cix:=0 to RO.nCity-1 do if MyCity[cix].Loc>=0 then
|
---|
407 | for iix:=imPalace to imSpacePort do
|
---|
408 | if MyCity[cix].Built[iix]>0 then
|
---|
409 | cixStateImp[iix]:=cix;
|
---|
410 | if RO.Happened and phChangeGov<>0 then
|
---|
411 | begin
|
---|
412 | NewGov:=ChooseGovernment;
|
---|
413 | if NewGov>gAnarchy then
|
---|
414 | Server(sSetGovernment,me,NewGov,nodata^);
|
---|
415 | end;
|
---|
416 | HaveTurned:=false;
|
---|
417 | Contacted:=[];
|
---|
418 | end;
|
---|
419 | if (Command=cContinue) and (MyAction=scContact) then
|
---|
420 | begin
|
---|
421 | if OnNegoRejected_CancelTreaty then
|
---|
422 | if RO.Treaty[Opponent]>=trPeace then
|
---|
423 | if Server(sCancelTreaty,me,0,nodata^)<rExecuted then
|
---|
424 | assert(false)
|
---|
425 | end
|
---|
426 | else UnwantedNego:=[];
|
---|
427 | Opponent:=-1;
|
---|
428 | repeat
|
---|
429 | if HaveTurned then NegoTime:=EndOfTurn
|
---|
430 | else NegoTime:=BeginOfTurn;
|
---|
431 | if RO.Government<>gAnarchy then
|
---|
432 | for Nation:=0 to nPl-1 do
|
---|
433 | if (Nation<>me) and (1 shl Nation and RO.Alive<>0)
|
---|
434 | and (RO.Treaty[Nation]>=trNone)
|
---|
435 | and not (Nation in Contacted) and not (Nation in UnwantedNego)
|
---|
436 | and (Server(scContact-sExecute + Nation shl 4, me, 0, nodata^)>=rExecuted) then
|
---|
437 | if WantNegotiation(Nation, NegoTime) then
|
---|
438 | begin
|
---|
439 | if Server(scContact + Nation shl 4, me, 0, nodata^)>=rExecuted then
|
---|
440 | begin
|
---|
441 | include(Contacted, Nation);
|
---|
442 | Opponent:=Nation;
|
---|
443 | MyAction:=scContact;
|
---|
444 | exit;
|
---|
445 | end;
|
---|
446 | end
|
---|
447 | else include(UnwantedNego,Nation);
|
---|
448 | if NegoTime=BeginOfTurn then
|
---|
449 | begin
|
---|
450 | DoTurn;
|
---|
451 | HaveTurned:=true;
|
---|
452 | Contacted:=[];
|
---|
453 | UnwantedNego:=[];
|
---|
454 | end
|
---|
455 | else break;
|
---|
456 | until false;
|
---|
457 | if RO.Happened and phTech<>0 then
|
---|
458 | begin
|
---|
459 | NewResearch:=ChooseResearchAdvance;
|
---|
460 | if NewResearch<0 then
|
---|
461 | begin // choose random research
|
---|
462 | count:=0;
|
---|
463 | for ad:=0 to nAdv-1 do if AdvanceResearchable(ad) then
|
---|
464 | begin inc(count); if random(count)=0 then NewResearch:=ad end
|
---|
465 | end;
|
---|
466 | Server(sSetResearch,me,NewResearch,nodata^)
|
---|
467 | end;
|
---|
468 | if Server(sTurn,me,0,nodata^)<rExecuted then
|
---|
469 | assert(false);
|
---|
470 | end;
|
---|
471 | scContact:
|
---|
472 | if WantNegotiation(integer(Data), EnemyCalled) then
|
---|
473 | begin
|
---|
474 | if Server(scDipStart, me, 0, nodata^)<rExecuted then
|
---|
475 | assert(false);
|
---|
476 | Opponent:=integer(Data);
|
---|
477 | MyAction:=scDipStart;
|
---|
478 | end
|
---|
479 | else
|
---|
480 | begin
|
---|
481 | if Server(scReject, me, 0, nodata^)<rExecuted then
|
---|
482 | assert(false);
|
---|
483 | end;
|
---|
484 | scDipStart, scDipNotice, scDipAccept, scDipCancelTreaty, scDipOffer, scDipBreak:
|
---|
485 | begin
|
---|
486 | OppoAction:=Command;
|
---|
487 | if Command=scDipOffer then OppoOffer:=TOffer(Data);
|
---|
488 | if Command=scDipStart then
|
---|
489 | MyLastAction:=scContact
|
---|
490 | else
|
---|
491 | begin
|
---|
492 | MyLastAction:=MyAction;
|
---|
493 | MyLastOffer:=MyOffer;
|
---|
494 | end;
|
---|
495 | if (OppoAction=scDipCancelTreaty) or (OppoAction=scDipBreak) then
|
---|
496 | MyAction:=scDipNotice
|
---|
497 | else begin MyAction:=scDipOffer; MyOffer.nDeliver:=0; MyOffer.nCost:=0; end;
|
---|
498 | DoNegotiation;
|
---|
499 | assert((MyAction=scDipNotice) or (MyAction=scDipAccept)
|
---|
500 | or (MyAction=scDipCancelTreaty) or (MyAction=scDipOffer)
|
---|
501 | or (MyAction=scDipBreak));
|
---|
502 | if MyAction=scDipOffer then Server(MyAction, me, 0, MyOffer)
|
---|
503 | else Server(MyAction, me, 0, nodata^);
|
---|
504 | end;
|
---|
505 | cShowEndContact:
|
---|
506 | Opponent:=-1;
|
---|
507 | end;
|
---|
508 | end;
|
---|
509 |
|
---|
510 | {$HINTS OFF}
|
---|
511 | procedure TCustomAI.SetDataDefaults;
|
---|
512 | begin
|
---|
513 | end;
|
---|
514 |
|
---|
515 | procedure TCustomAI.SetDataRandom;
|
---|
516 | begin
|
---|
517 | end;
|
---|
518 |
|
---|
519 | procedure TCustomAI.DoTurn;
|
---|
520 | begin
|
---|
521 | end;
|
---|
522 |
|
---|
523 | procedure TCustomAI.DoNegotiation;
|
---|
524 | begin
|
---|
525 | end;
|
---|
526 |
|
---|
527 | procedure TCustomAI.OnBeforeEnemyAttack(UnitInfo: TUnitInfo; ToLoc, EndHealth,
|
---|
528 | EndHealthDef: integer);
|
---|
529 | begin
|
---|
530 | end;
|
---|
531 |
|
---|
532 | procedure TCustomAI.OnBeforeEnemyCapture(UnitInfo: TUnitInfo; ToLoc: integer);
|
---|
533 | begin
|
---|
534 | end;
|
---|
535 |
|
---|
536 | procedure TCustomAI.OnAfterEnemyAttack;
|
---|
537 | begin
|
---|
538 | end;
|
---|
539 |
|
---|
540 | procedure TCustomAI.OnAfterEnemyCapture;
|
---|
541 | begin
|
---|
542 | end;
|
---|
543 |
|
---|
544 | function TCustomAI.ChooseResearchAdvance: integer;
|
---|
545 | begin
|
---|
546 | result:=-1
|
---|
547 | end;
|
---|
548 |
|
---|
549 | function TCustomAI.ChooseStealAdvance: integer;
|
---|
550 | begin
|
---|
551 | result:=-1
|
---|
552 | end;
|
---|
553 |
|
---|
554 | function TCustomAI.ChooseGovernment: integer;
|
---|
555 | begin
|
---|
556 | result:=gDespotism
|
---|
557 | end;
|
---|
558 |
|
---|
559 | function TCustomAI.WantNegotiation(Nation: integer; NegoTime: TNegoTime): boolean;
|
---|
560 | begin
|
---|
561 | result:=false;
|
---|
562 | end;
|
---|
563 |
|
---|
564 | function TCustomAI.OnNegoRejected_CancelTreaty: boolean;
|
---|
565 | begin
|
---|
566 | result:=false;
|
---|
567 | end;
|
---|
568 | {$HINTS ON}
|
---|
569 |
|
---|
570 | procedure TCustomAI.StealAdvance;
|
---|
571 | var
|
---|
572 | Steal, ad, count: integer;
|
---|
573 | begin
|
---|
574 | Steal:=ChooseStealAdvance;
|
---|
575 | if Steal<0 then
|
---|
576 | begin // choose random advance
|
---|
577 | count:=0;
|
---|
578 | for ad:=0 to nAdv-1 do if AdvanceStealable(ad) then
|
---|
579 | begin inc(count); if random(count)=0 then Steal:=ad end
|
---|
580 | end;
|
---|
581 | if Steal>=0 then Server(sStealTech,me,Steal,nodata^);
|
---|
582 | RO.Happened:=RO.Happened and not phStealTech
|
---|
583 | end;
|
---|
584 |
|
---|
585 | function TCustomAI.IsResearched(Advance: integer): boolean;
|
---|
586 | begin
|
---|
587 | result:= (Advance=preNone)
|
---|
588 | or (Advance<>preNA) and (RO.Tech[Advance]>=tsApplicable)
|
---|
589 | end;
|
---|
590 |
|
---|
591 | function TCustomAI.ResearchCost: integer;
|
---|
592 | begin
|
---|
593 | Server(sGetTechCost,me,0,result)
|
---|
594 | end;
|
---|
595 |
|
---|
596 | function TCustomAI.ChangeAttitude(Nation, Attitude: integer): integer;
|
---|
597 | begin
|
---|
598 | result:=Server(sSetAttitude+Nation shl 4,me,Attitude,nodata^)
|
---|
599 | end;
|
---|
600 |
|
---|
601 | function TCustomAI.Revolution: integer;
|
---|
602 | begin
|
---|
603 | result:=Server(sRevolution,me,0,nodata^);
|
---|
604 | end;
|
---|
605 |
|
---|
606 | function TCustomAI.ChangeRates(Tax,Lux: integer): integer;
|
---|
607 | begin
|
---|
608 | result:=Server(sSetRates,me,Tax div 10 and $f+Lux div 10 and $f shl 4,nodata^)
|
---|
609 | end;
|
---|
610 |
|
---|
611 | function TCustomAI.PrepareNewModel(Domain: integer): integer;
|
---|
612 | begin
|
---|
613 | result:=Server(sCreateDevModel,me,Domain,nodata^);
|
---|
614 | end;
|
---|
615 |
|
---|
616 | function TCustomAI.SetNewModelFeature(F, Count: integer): integer;
|
---|
617 | begin
|
---|
618 | result:=Server(sSetDevModelCap+Count shl 4,me,F,nodata^)
|
---|
619 | end;
|
---|
620 |
|
---|
621 | function TCustomAI.AdvanceResearchable(Advance: integer): boolean;
|
---|
622 | begin
|
---|
623 | result:= Server(sSetResearch-sExecute,me,Advance,nodata^)>=rExecuted;
|
---|
624 | end;
|
---|
625 |
|
---|
626 | function TCustomAI.AdvanceStealable(Advance: integer): boolean;
|
---|
627 | begin
|
---|
628 | result:= Server(sStealTech-sExecute,me,Advance,nodata^)>=rExecuted;
|
---|
629 | end;
|
---|
630 |
|
---|
631 | function TCustomAI.GetJobProgress(Loc: integer; var JobProgress: TJobProgressData): boolean;
|
---|
632 | begin
|
---|
633 | result:= Server(sGetJobProgress,me,Loc,JobProgress)>=rExecuted;
|
---|
634 | end;
|
---|
635 |
|
---|
636 | function TCustomAI.DebugMessage(Level: integer; Text: string): boolean;
|
---|
637 | begin
|
---|
638 | Text:=copy('P'+char(48+me)+' '+Text,1,254);
|
---|
639 | Server(sMessage,me,Level,pchar(Text)^);
|
---|
640 |
|
---|
641 | result:=true;
|
---|
642 | // always returns true so that it can be used like
|
---|
643 | // "assert(DebugMessage(...));" -> not compiled in release build
|
---|
644 | end;
|
---|
645 |
|
---|
646 | function TCustomAI.SetDebugMap(var DebugMap): boolean;
|
---|
647 | begin
|
---|
648 | Server(sSetDebugMap, me, 0, DebugMap);
|
---|
649 |
|
---|
650 | result:=true;
|
---|
651 | // always returns true so that it can be used like
|
---|
652 | // "assert(SetDebugMap(...));" -> not compiled in release build
|
---|
653 | end;
|
---|
654 |
|
---|
655 | procedure TCustomAI.Unit_FindMyDefender(Loc: integer; var uix: integer);
|
---|
656 | begin
|
---|
657 | if Server(sGetDefender,me,Loc,uix)<rExecuted then uix:=-1
|
---|
658 | end;
|
---|
659 |
|
---|
660 | procedure TCustomAI.Unit_FindEnemyDefender(Loc: integer; var euix: integer);
|
---|
661 | begin
|
---|
662 | euix:=RO.nEnemyUn-1;
|
---|
663 | while (euix>=0) and (RO.EnemyUn[euix].Loc<>Loc) do
|
---|
664 | dec(euix);
|
---|
665 | end;
|
---|
666 |
|
---|
667 | function TCustomAI.Unit_Move(uix,ToLoc: integer): integer;
|
---|
668 | var
|
---|
669 | Step: integer;
|
---|
670 | DestinationReached: boolean;
|
---|
671 | Advice: TMoveAdviceData;
|
---|
672 | begin
|
---|
673 | assert((uix>=0) and (uix<RO.nUn) and (MyUnit[uix].Loc>=0)); // is a unit
|
---|
674 | {Loc_to_ab(MyUnit[uix].Loc,ToLoc,a,b);
|
---|
675 | assert((a<>0) or (b<>0));
|
---|
676 | if (a>=-1) and (a<=1) and (b>=-1) and (b<=1) then
|
---|
677 | begin // move to adjacent tile
|
---|
678 | !!!problem: if move is invalid, return codes are not consistent with other branch (eNoWay)
|
---|
679 | Advice.nStep:=1;
|
---|
680 | Advice.dx[0]:=a-b;
|
---|
681 | Advice.dy[0]:=a+b;
|
---|
682 | Advice.MoreTurns:=0;
|
---|
683 | Advice.MaxHostile_MovementLeft:=MyUnit[uix].Movement;
|
---|
684 | result:=eOK;
|
---|
685 | end
|
---|
686 | else}
|
---|
687 | begin // move to non-adjacent tile, find shortest path
|
---|
688 | Advice.ToLoc:=ToLoc;
|
---|
689 | Advice.MoreTurns:=9999;
|
---|
690 | Advice.MaxHostile_MovementLeft:=100;
|
---|
691 | result:=Server(sGetMoveAdvice,me,uix,Advice);
|
---|
692 | end;
|
---|
693 | if result=eOk then
|
---|
694 | begin
|
---|
695 | DestinationReached:=false;
|
---|
696 | Step:=0;
|
---|
697 | repeat
|
---|
698 | if result and (rExecuted or rUnitRemoved)=rExecuted then // check if destination reached
|
---|
699 | if (ToLoc>=0) and (Advice.MoreTurns=0) and (Step=Advice.nStep-1)
|
---|
700 | and ((Map[ToLoc] and (fUnit or fOwned)=fUnit) // attack
|
---|
701 | or (Map[ToLoc] and (fCity or fOwned)=fCity)
|
---|
702 | and ((MyModel[MyUnit[uix].mix].Domain<>dGround) // bombardment
|
---|
703 | or (MyModel[MyUnit[uix].mix].Flags and mdCivil<>0))) then // can't capture
|
---|
704 | begin DestinationReached:=true; break end // stop next to destination
|
---|
705 | else if Step=Advice.nStep then
|
---|
706 | DestinationReached:=true; // normal move -- stop at destination
|
---|
707 |
|
---|
708 | if (Step=Advice.nStep) or (result<>eOK) and (result<>eLoaded) then
|
---|
709 | break;
|
---|
710 |
|
---|
711 | result:=Server(sMoveUnit+(Advice.dx[Step] and 7) shl 4 +(Advice.dy[Step] and 7) shl 7,
|
---|
712 | me,uix,nodata^);
|
---|
713 | inc(Step);
|
---|
714 | if RO.Happened and phStealTech<>0 then StealAdvance;
|
---|
715 | until false;
|
---|
716 | if DestinationReached then
|
---|
717 | if Advice.nStep=25 then
|
---|
718 | result:=Unit_Move(uix,ToLoc) // Shinkansen
|
---|
719 | else if Advice.MoreTurns=0 then
|
---|
720 | result:=result or rLocationReached
|
---|
721 | else result:=result or rMoreTurns;
|
---|
722 | end
|
---|
723 | end;
|
---|
724 |
|
---|
725 | function TCustomAI.Unit_Step(uix,ToLoc: integer): integer;
|
---|
726 | var
|
---|
727 | a,b: integer;
|
---|
728 | begin
|
---|
729 | Loc_to_ab(MyUnit[uix].Loc, ToLoc, a, b);
|
---|
730 | assert(((a<>0) or (b<>0)) and (a>=-1) and (a<=1) and (b>=-1) and (b<=1));
|
---|
731 | result:=Server(sMoveUnit+((a-b) and 7) shl 4 +((a+b) and 7) shl 7, me, uix, nodata^);
|
---|
732 | if RO.Happened and phStealTech<>0 then StealAdvance;
|
---|
733 | end;
|
---|
734 |
|
---|
735 | function TCustomAI.Unit_Attack(uix,ToLoc: integer): integer;
|
---|
736 | var
|
---|
737 | a,b: integer;
|
---|
738 | begin
|
---|
739 | assert((uix>=0) and (uix<RO.nUn) and (MyUnit[uix].Loc>=0) // is a unit
|
---|
740 | and ((Map[ToLoc] and (fUnit or fOwned)=fUnit) // is an attack
|
---|
741 | or (Map[ToLoc] and (fCity or fOwned)=fCity)
|
---|
742 | and (MyModel[MyUnit[uix].mix].Domain<>dGround))); // is a bombardment
|
---|
743 | Loc_to_ab(MyUnit[uix].Loc,ToLoc,a,b);
|
---|
744 | assert(((a<>0) or (b<>0)) and (a>=-1) and (a<=1) and (b>=-1) and (b<=1)); // attack to adjacent tile
|
---|
745 | result:=Server(sMoveUnit+(a-b) and 7 shl 4 +(a+b) and 7 shl 7,me,uix,nodata^);
|
---|
746 | end;
|
---|
747 |
|
---|
748 | function TCustomAI.Unit_DoMission(uix,MissionType,ToLoc: integer): integer;
|
---|
749 | var
|
---|
750 | a,b: integer;
|
---|
751 | begin
|
---|
752 | result:=Server(sSetSpyMission + MissionType shl 4,me,0,nodata^);
|
---|
753 | if result>=rExecuted then
|
---|
754 | begin
|
---|
755 | assert((uix>=0) and (uix<RO.nUn) and (MyUnit[uix].Loc>=0) // is a unit
|
---|
756 | and (MyModel[MyUnit[uix].mix].Kind=mkDiplomat)); // is a commando
|
---|
757 | Loc_to_ab(MyUnit[uix].Loc,ToLoc,a,b);
|
---|
758 | assert(((a<>0) or (b<>0)) and (a>=-1) and (a<=1) and (b>=-1) and (b<=1)); // city must be adjacent
|
---|
759 | result:=Server(sMoveUnit-sExecute+(a-b) and 7 shl 4 +(a+b) and 7 shl 7,me,uix,nodata^);
|
---|
760 | if result=eMissionDone then
|
---|
761 | result:=Server(sMoveUnit+(a-b) and 7 shl 4 +(a+b) and 7 shl 7,me,uix,nodata^)
|
---|
762 | else if (result<>eNoTime_Move) and (result<>eTreaty) and (result<>eNoTurn) then
|
---|
763 | result:=eInvalid // not a special commando mission!
|
---|
764 | end
|
---|
765 | end;
|
---|
766 |
|
---|
767 | function TCustomAI.Unit_MoveForecast(uix,ToLoc: integer;
|
---|
768 | var RemainingMovement: integer): boolean;
|
---|
769 | var
|
---|
770 | Advice: TMoveAdviceData;
|
---|
771 | begin
|
---|
772 | assert((uix>=0) and (uix<RO.nUn) and (MyUnit[uix].Loc>=0)); // is a unit
|
---|
773 | Advice.ToLoc:=ToLoc;
|
---|
774 | Advice.MoreTurns:=0;
|
---|
775 | Advice.MaxHostile_MovementLeft:=100;
|
---|
776 | if Server(sGetMoveAdvice,me,uix,Advice)=eOk then
|
---|
777 | begin
|
---|
778 | RemainingMovement:=Advice.MaxHostile_MovementLeft;
|
---|
779 | result:=true
|
---|
780 | end
|
---|
781 | else
|
---|
782 | begin
|
---|
783 | RemainingMovement:=-1;
|
---|
784 | result:=false
|
---|
785 | end
|
---|
786 | end;
|
---|
787 |
|
---|
788 | // negative RemainingHealth is remaining helth of defender if lost
|
---|
789 | function TCustomAI.Unit_AttackForecast(uix,ToLoc,AttackMovement: integer;
|
---|
790 | var RemainingHealth: integer): boolean;
|
---|
791 | var
|
---|
792 | BattleForecast: TBattleForecast;
|
---|
793 | begin
|
---|
794 | assert((uix>=0) and (uix<RO.nUn) and (MyUnit[uix].Loc>=0) // is a unit
|
---|
795 | and (Map[ToLoc] and (fUnit or fOwned)=fUnit)); // is an attack
|
---|
796 | RemainingHealth:=-$100;
|
---|
797 | result:=false;
|
---|
798 | if AttackMovement>=0 then with MyUnit[uix] do
|
---|
799 | begin
|
---|
800 | BattleForecast.pAtt:=me;
|
---|
801 | BattleForecast.mixAtt:=mix;
|
---|
802 | BattleForecast.HealthAtt:=Health;
|
---|
803 | BattleForecast.ExpAtt:=Exp;
|
---|
804 | BattleForecast.FlagsAtt:=Flags;
|
---|
805 | BattleForecast.Movement:=AttackMovement;
|
---|
806 | if Server(sGetBattleForecast,me,ToLoc,BattleForecast)>=rExecuted then
|
---|
807 | begin
|
---|
808 | if BattleForecast.EndHealthAtt>0 then
|
---|
809 | RemainingHealth:=BattleForecast.EndHealthAtt
|
---|
810 | else RemainingHealth:=-BattleForecast.EndHealthDef;
|
---|
811 | result:=true
|
---|
812 | end
|
---|
813 | end
|
---|
814 | end;
|
---|
815 |
|
---|
816 | function TCustomAI.Unit_DefenseForecast(euix,ToLoc: integer;
|
---|
817 | var RemainingHealth: integer): boolean;
|
---|
818 | var
|
---|
819 | BattleForecast: TBattleForecast;
|
---|
820 | begin
|
---|
821 | assert((euix>=0) and (euix<RO.nEnemyUn) and (RO.EnemyUn[euix].Loc>=0) // is an enemy unit
|
---|
822 | and (Map[ToLoc] and (fUnit or fOwned)=(fUnit or fOwned))); // is an attack
|
---|
823 | RemainingHealth:=$100;
|
---|
824 | result:=false;
|
---|
825 | with RO.EnemyUn[euix] do
|
---|
826 | begin
|
---|
827 | BattleForecast.pAtt:=Owner;
|
---|
828 | BattleForecast.mixAtt:=mix;
|
---|
829 | BattleForecast.HealthAtt:=Health;
|
---|
830 | BattleForecast.ExpAtt:=Exp;
|
---|
831 | BattleForecast.FlagsAtt:=Flags;
|
---|
832 | BattleForecast.Movement:=100;
|
---|
833 | if Server(sGetBattleForecast,me,ToLoc,BattleForecast)>=rExecuted then
|
---|
834 | begin
|
---|
835 | if BattleForecast.EndHealthDef>0 then
|
---|
836 | RemainingHealth:=BattleForecast.EndHealthDef
|
---|
837 | else RemainingHealth:=-BattleForecast.EndHealthAtt;
|
---|
838 | result:=true
|
---|
839 | end
|
---|
840 | end
|
---|
841 | end;
|
---|
842 |
|
---|
843 | function TCustomAI.Unit_Disband(uix: integer): integer;
|
---|
844 | begin
|
---|
845 | result:=Server(sRemoveUnit,me,uix,nodata^)
|
---|
846 | end;
|
---|
847 |
|
---|
848 | function TCustomAI.Unit_StartJob(uix,NewJob: integer): integer;
|
---|
849 | begin
|
---|
850 | result:=Server(sStartJob+NewJob shl 4,me,uix,nodata^)
|
---|
851 | end;
|
---|
852 |
|
---|
853 | function TCustomAI.Unit_SetHomeHere(uix: integer): integer;
|
---|
854 | begin
|
---|
855 | result:=Server(sSetUnitHome,me,uix,nodata^)
|
---|
856 | end;
|
---|
857 |
|
---|
858 | function TCustomAI.Unit_Load(uix: integer): integer;
|
---|
859 | begin
|
---|
860 | result:=Server(sLoadUnit,me,uix,nodata^)
|
---|
861 | end;
|
---|
862 |
|
---|
863 | function TCustomAI.Unit_Unload(uix: integer): integer;
|
---|
864 | begin
|
---|
865 | result:=Server(sUnloadUnit,me,uix,nodata^)
|
---|
866 | end;
|
---|
867 |
|
---|
868 | function TCustomAI.Unit_AddToCity(uix: integer): integer;
|
---|
869 | begin
|
---|
870 | result:=Server(sAddToCity,me,uix,nodata^)
|
---|
871 | end;
|
---|
872 |
|
---|
873 | function TCustomAI.Unit_SelectTransport(uix: integer): integer;
|
---|
874 | begin
|
---|
875 | result:=Server(sSelectTransport,me,uix,nodata^)
|
---|
876 | end;
|
---|
877 |
|
---|
878 |
|
---|
879 | procedure TCustomAI.City_FindMyCity(Loc: integer; var cix: integer);
|
---|
880 | begin
|
---|
881 | if Map[Loc] and (fCity or fOwned)<>fCity or fOwned then
|
---|
882 | cix:=-1
|
---|
883 | else
|
---|
884 | begin
|
---|
885 | cix:=RO.nCity-1;
|
---|
886 | while (cix>=0) and (MyCity[cix].Loc<>Loc) do
|
---|
887 | dec(cix);
|
---|
888 | end
|
---|
889 | end;
|
---|
890 |
|
---|
891 | procedure TCustomAI.City_FindEnemyCity(Loc: integer; var ecix: integer);
|
---|
892 | begin
|
---|
893 | if Map[Loc] and (fCity or fOwned)<>fCity then
|
---|
894 | ecix:=-1
|
---|
895 | else
|
---|
896 | begin
|
---|
897 | ecix:=RO.nEnemyCity-1;
|
---|
898 | while (ecix>=0) and (RO.EnemyCity[ecix].Loc<>Loc) do
|
---|
899 | dec(ecix);
|
---|
900 | end
|
---|
901 | end;
|
---|
902 |
|
---|
903 | function TCustomAI.City_HasProject(cix: integer): boolean;
|
---|
904 | begin
|
---|
905 | result:= MyCity[cix].Project and (cpImp+cpIndex)<>cpImp+imTrGoods
|
---|
906 | end;
|
---|
907 |
|
---|
908 | function TCustomAI.City_CurrentImprovementProject(cix: integer): integer;
|
---|
909 | begin
|
---|
910 | if MyCity[cix].Project and cpImp=0 then result:=-1
|
---|
911 | else
|
---|
912 | begin
|
---|
913 | result:=MyCity[cix].Project and cpIndex;
|
---|
914 | if result=imTrGoods then result:=-1
|
---|
915 | end
|
---|
916 | end;
|
---|
917 |
|
---|
918 | function TCustomAI.City_CurrentUnitProject(cix: integer): integer;
|
---|
919 | begin
|
---|
920 | if MyCity[cix].Project and cpImp<>0 then result:=-1
|
---|
921 | else result:=MyCity[cix].Project and cpIndex;
|
---|
922 | end;
|
---|
923 |
|
---|
924 | function TCustomAI.City_GetTileInfo(cix,TileLoc: integer; var TileInfo: TTileInfo): integer;
|
---|
925 | begin
|
---|
926 | TileInfo.ExplCity:=cix;
|
---|
927 | result:=Server(sGetHypoCityTileInfo,me,TileLoc,TileInfo)
|
---|
928 | end;
|
---|
929 |
|
---|
930 | function TCustomAI.City_GetReport(cix: integer; var Report: TCityReport): integer;
|
---|
931 | begin
|
---|
932 | Report.HypoTiles:=-1;
|
---|
933 | Report.HypoTax:=-1;
|
---|
934 | Report.HypoLux:=-1;
|
---|
935 | result:=Server(sGetCityReport,me,cix,Report)
|
---|
936 | end;
|
---|
937 |
|
---|
938 | function TCustomAI.City_GetHypoReport(cix, HypoTiles, HypoTax, HypoLux: integer;
|
---|
939 | var Report: TCityReport): integer;
|
---|
940 | begin
|
---|
941 | Report.HypoTiles:=HypoTiles;
|
---|
942 | Report.HypoTax:=HypoTax;
|
---|
943 | Report.HypoLux:=HypoLux;
|
---|
944 | result:=Server(sGetCityReport,me,cix,Report)
|
---|
945 | end;
|
---|
946 |
|
---|
947 | function TCustomAI.City_GetReportNew(cix: integer; var Report: TCityReportNew): integer;
|
---|
948 | begin
|
---|
949 | Report.HypoTiles:=-1;
|
---|
950 | Report.HypoTaxRate:=-1;
|
---|
951 | Report.HypoLuxuryRate:=-1;
|
---|
952 | result:=Server(sGetCityReportNew,me,cix,Report)
|
---|
953 | end;
|
---|
954 |
|
---|
955 | function TCustomAI.City_GetHypoReportNew(cix, HypoTiles, HypoTaxRate, HypoLuxuryRate: integer;
|
---|
956 | var Report: TCityReportNew): integer;
|
---|
957 | begin
|
---|
958 | Report.HypoTiles:=HypoTiles;
|
---|
959 | Report.HypoTaxRate:=HypoTaxRate;
|
---|
960 | Report.HypoLuxuryRate:=HypoLuxuryRate;
|
---|
961 | result:=Server(sGetCityReportNew,me,cix,Report)
|
---|
962 | end;
|
---|
963 |
|
---|
964 | function TCustomAI.City_GetAreaInfo(cix: integer; var AreaInfo: TCityAreaInfo): integer;
|
---|
965 | begin
|
---|
966 | result:=Server(sGetCityAreaInfo,me,cix,AreaInfo)
|
---|
967 | end;
|
---|
968 |
|
---|
969 | function TCustomAI.City_StartUnitProduction(cix,mix: integer): integer;
|
---|
970 | begin
|
---|
971 | if (MyCity[cix].Project and (cpImp+cpIndex)<>mix) then
|
---|
972 | // not already producing that
|
---|
973 | result:=Server(sSetCityProject,me,cix,mix)
|
---|
974 | end;
|
---|
975 |
|
---|
976 | function TCustomAI.City_StartEmigration(cix,mix: integer;
|
---|
977 | AllowDisbandCity, AsConscripts: boolean): integer;
|
---|
978 | var
|
---|
979 | NewProject: integer;
|
---|
980 | begin
|
---|
981 | NewProject:=mix;
|
---|
982 | if AllowDisbandCity then NewProject:=NewProject or cpDisbandCity;
|
---|
983 | if AsConscripts then NewProject:=NewProject or cpConscripts;
|
---|
984 | result:=Server(sSetCityProject,me,cix,NewProject)
|
---|
985 | end;
|
---|
986 |
|
---|
987 | function TCustomAI.City_StartImprovement(cix,iix: integer): integer;
|
---|
988 | var
|
---|
989 | NewProject: integer;
|
---|
990 | begin
|
---|
991 | NewProject:=iix+cpImp;
|
---|
992 | if (MyCity[cix].Project and (cpImp+cpIndex)<>NewProject) then
|
---|
993 | // not already producing that
|
---|
994 | result:=Server(sSetCityProject,me,cix,NewProject)
|
---|
995 | end;
|
---|
996 |
|
---|
997 | function TCustomAI.City_Improvable(cix,iix: integer): boolean;
|
---|
998 | var
|
---|
999 | NewProject: integer;
|
---|
1000 | begin
|
---|
1001 | NewProject:=iix+cpImp;
|
---|
1002 | result:= Server(sSetCityProject-sExecute,me,cix,NewProject)>=rExecuted;
|
---|
1003 | end;
|
---|
1004 |
|
---|
1005 | function TCustomAI.City_StopProduction(cix: integer): integer;
|
---|
1006 | var
|
---|
1007 | NewProject: integer;
|
---|
1008 | begin
|
---|
1009 | NewProject:=imTrGoods+cpImp;
|
---|
1010 | result:=Server(sSetCityProject,me,cix,NewProject)
|
---|
1011 | end;
|
---|
1012 |
|
---|
1013 | function TCustomAI.City_BuyProject(cix: integer): integer;
|
---|
1014 | begin
|
---|
1015 | result:=Server(sBuyCityProject,me,cix,nodata^)
|
---|
1016 | end;
|
---|
1017 |
|
---|
1018 | function TCustomAI.City_SellImprovement(cix,iix: integer): integer;
|
---|
1019 | begin
|
---|
1020 | result:=Server(sSellCityImprovement,me,cix,iix)
|
---|
1021 | end;
|
---|
1022 |
|
---|
1023 | function TCustomAI.City_RebuildImprovement(cix,iix: integer): integer;
|
---|
1024 | begin
|
---|
1025 | result:=Server(sRebuildCityImprovement,me,cix,iix)
|
---|
1026 | end;
|
---|
1027 |
|
---|
1028 | function TCustomAI.City_SetTiles(cix,NewTiles: integer): integer;
|
---|
1029 | begin
|
---|
1030 | result:=Server(sSetCityTiles,me,cix,NewTiles)
|
---|
1031 | end;
|
---|
1032 |
|
---|
1033 | procedure TCustomAI.City_OptimizeTiles(cix: integer; ResourceWeights: cardinal);
|
---|
1034 | var
|
---|
1035 | Advice: TCityTileAdviceData;
|
---|
1036 | begin
|
---|
1037 | Advice.ResourceWeights:=ResourceWeights;
|
---|
1038 | Server(sGetCityTileAdvice, me, cix, Advice);
|
---|
1039 | City_SetTiles(cix, Advice.Tiles);
|
---|
1040 | end;
|
---|
1041 |
|
---|
1042 |
|
---|
1043 | // negotiation
|
---|
1044 | function TCustomAI.Nego_CheckMyAction: integer;
|
---|
1045 | begin
|
---|
1046 | assert(Opponent>=0); // only allowed in negotiation mode
|
---|
1047 | assert((MyAction=scDipNotice) or (MyAction=scDipAccept)
|
---|
1048 | or (MyAction=scDipCancelTreaty) or (MyAction=scDipOffer)
|
---|
1049 | or (MyAction=scDipBreak));
|
---|
1050 | if MyAction=scDipOffer then result:=Server(MyAction-sExecute, me, 0, MyOffer)
|
---|
1051 | else result:=Server(MyAction-sExecute, me, 0, nodata^);
|
---|
1052 | end;
|
---|
1053 |
|
---|
1054 |
|
---|
1055 | initialization
|
---|
1056 | nodata:=pointer(0);
|
---|
1057 | RWDataSize:=0;
|
---|
1058 |
|
---|
1059 | end.
|
---|
1060 |
|
---|