-
Notifications
You must be signed in to change notification settings - Fork 16
/
wmonster.pp
1368 lines (1221 loc) · 47 KB
/
wmonster.pp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
unit WMonster;
{
GearHead2, a roguelike mecha CRPG
Copyright (C) 2005 Joseph Hewitt
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at
your option) any later version.
The full text of the LGPL can be found in license.txt.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this library; if not, write to the Free Software Foundation,
Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
}
{$LONGSTRINGS ON}
interface
uses gears,locale;
const
{ This is the minimum point value for meks when calling the STOCKSCENE }
{ procedure. }
MinPointValue = 65000;
Procedure RestockRandomMonsters( GB: GameBoardPtr );
Procedure StockBoardWithMonsters( GB: GameBoardPtr; Renown,Strength,TeamID: Integer; MDesc: String );
Function MechaMatchesFaction( Mek: GearPtr; const Factions: String ): Boolean;
Function OptimalMechaValue( Renown: Integer ): LongInt;
Procedure AddTeamForces( GB: GameBoardPtr; TeamID,Renown,Strength: Integer );
Function SelectNPCMecha( GB: GameBoardPtr; Scene,NPC: GearPtr ): GearPtr;
Procedure SelectEquipmentForNPC( GB: GameBoardPtr; NPC: GearPtr; Renown: Integer );
Procedure EquipThenDeploy( GB: GameBoardPtr; NPC: GearPtr; PutOnMap: Boolean );
implementation
uses dos,ability,action,gearutil,ghchars,gearparser,texutil,narration,movement,
customization,ghweapon,ghmodule,ghholder,ui4gh,
{$IFDEF ASCII}
vidmap,vidgfx;
{$ELSE}
sdlmap,sdlgfx;
{$ENDIF}
const
UTYPE_General = 'GENERAL';
UTYPE_Assault = 'ASSAULT';
UTYPE_Defense = 'DEFENSE';
ROLE_Trooper = 1;
ROLE_Support = 2;
ROLE_Command = 3;
Function MatchWeight( S, M: String ): Integer;
{ Return a value showing how well the monster M matches the }
{ quoted source S. }
var
Trait: String;
it: Integer;
begin
it := 0;
while M <> '' do begin
Trait := ExtractWord( M );
if AStringHasBString( S , Trait ) then begin
if it = 0 then it := 1
else it := it * 2;
end;
end;
MatchWeight := it;
end;
Function MonsterStrength( Mon: GearPtr; Renown: Integer ): Integer;
{ Return the Strength, or point cost, of this monster. The strength }
{ isn't based objectively on the monster's level, but calculated }
{ relatively from the provided threat value. }
const
BaseStrengthValue = 15;
MinStrengthValue = 1;
var
it: Integer;
begin
it := MonsterThreatLevel( Mon );
if Renown < 1 then Renown := 1;
if it > Renown then begin
it := ( it * 3 - Renown * 2 ) * BaseStrengthValue div Renown;
end else begin
it := it * BaseStrengthValue div Renown;
end;
if it < MinStrengthValue then it := MinStrengthValue;
MonsterStrength := it;
end;
Function GenerateMonster( Renown,Scale: Integer; const MType,Habitat: String; Scene: GearPtr ): GearPtr;
{ Generate a monster with no greater than MaxTV threat value, }
{ which corresponds to MDesc. Its type must match MType and its habitat must be compatable with Habitat. }
{ Finally, the monsters's characteristics must be appropriate for the scene it will be placed in: }
{ really, the big thing to check is that the generated monster will be able to breathe in this scene. }
Function HabitatMatch( M: GearPtr ): Boolean;
{ Return TRUE if M can appear in this habitat, or FALSE otherwise. }
var
MHabitat: String;
begin
if Habitat = '' then Exit( True );
MHabitat := SAttValue( M^.SA , 'HABITAT' );
HabitatMatch := ( MHabitat = '' ) or PartAtLeastOneMatch( Habitat , MHabitat );
end;
Function EnvironmentMatch( M: GearPtr ): Boolean;
{ Return TRUE if this monster can survive in SCENE, or FALSE otherwise. }
begin
if Scene = Nil then begin
EnvironmentMatch := True;
end else if NAttValue( Scene^.NA , NAG_EnvironmentData , NAS_Atmosphere ) = NAV_Vacuum then begin
EnvironmentMatch := IsEnviroSealed( M ) or ( NAttValue( M^.NA , NAG_GearOps , NAS_Material ) = NAV_Metal );
end else begin
EnvironmentMatch := True;
end;
end;
var
MonRenown,MaxRenown: Integer;
ShoppingList,ShoppingItem: NAttPtr;
Total,Smallest,SmallTV: LongInt;
WM: GearPtr;
N,Match: Integer;
begin
ShoppingList := Nil;
WM := WMonList;
N := 1;
Total := 0;
Smallest := 0;
SmallTV := 100000;
if Renown < 1 then Renown := 1;
MaxRenown := ( Renown * 3 ) div 2;
if MaxRenown < ( Renown + 20 ) then MaxRenown := Renown + 20;
while WM <> Nil do begin
{ If this monster matches our criteria, maybe add its number to the list. }
if ( WM^.Scale <= Scale ) and HabitatMatch( WM ) and EnvironmentMatch( WM ) then begin
MonRenown := MonsterThreatLevel( WM );
Match := MatchWeight( MType , SAttValue( WM^.SA , 'TYPE' ) );
if ( Match > 0 ) then begin
if ( ( MonRenown > ( Renown + 10 ) ) or ( MonRenown < ( Renown - 20 ) ) ) then begin
Match := Match div 4;
end;
if Match < 1 then Match := 1;
end;
{ If this monster's threat value is within the acceptable range, add it to the list. }
{ Otherwise see if it's the smallest TV found so far, in which case store its identity }
{ just in case no monsters with acceptable TV are found. }
if MonRenown <= MaxRenown then begin
SetNAtt( ShoppingList , 0 , N , Match );
Total := Total + Match;
end else if MonsterThreatLevel( WM ) < SmallTV then begin
Smallest := N;
SmallTV := MonsterThreatLevel( WM );
end;
end;
{ Move to the next monster, and increase the monster index. }
WM := WM^.Next;
Inc( N );
end;
if Total > 0 then begin
Match := Random( Total );
ShoppingItem := ShoppingList;
while Match > ShoppingItem^.V do begin
Match := Match - ShoppingItem^.V;
ShoppingItem := ShoppingItem^.Next;
end;
N := ShoppingItem^.S;
{ Return the selected monster. }
WM := CloneGear( RetrieveGearSib( WMonList , N ) );
end else if Smallest > 0 then begin
WM := CloneGear( RetrieveGearSib( WMonList , Smallest ) );
end else begin
{ Return a random monster. }
WM := CloneGear( SelectRandomGear( WMonList ) );
end;
DisposeNAtt( ShoppingList );
SetSATt( WM^.SA , 'JOB <ANIMAL>' );
GenerateMonster := WM;
end;
Procedure AddRandomMonsters( GB: GameBoardPtr; const WMonType: String; TeamID , Renown,Strength,Gen: Integer );
{ Place some wandering monsters on the map. }
var
WM: GearPtr;
Habitat: String;
begin
{ Find the WMonType and the Habitat. }
if GB^.Scene <> Nil then begin
Habitat := SAttValue( GB^.Scene^.SA , 'HABITAT' );
end else Habitat := '';
while ( Gen > 0 ) and ( Strength > 0 ) do begin
WM := GenerateMonster( Renown , GB^.Scale , WMonType , Habitat , GB^.Scene );
SetNAtt( WM^.NA , NAG_Location , NAS_Team , TeamID );
DeployGear( GB , WM , True );
{ Reduce the generation counter and the threat points. }
Strength := Strength - MonsterStrength( WM , Renown );
Dec( Gen );
end;
end;
Procedure StockBoardWithMonsters( GB: GameBoardPtr; Renown,Strength,TeamID: Integer; MDesc: String );
{ Place some monsters in this scene. }
begin
AddRandomMonsters( GB , MDesc , TeamID , Renown , Strength , 9999 );
end;
Function TeamTV( MList: GearPtr; Team,Threat: Integer ): LongInt;
{ Calculate the total monster strength value of active models belonging }
{ to TEAM which are present on the map. }
{ Generally, only characters have monster threat values. }
var
it: LongInt;
begin
it := 0;
while MList <> Nil do begin
if GearActive( MList ) and ( NAttValue( MList^.NA , NAG_Location , NAS_TEam ) = Team ) then begin
it := it + MonsterStrength( MList , Threat );
end;
MList := MList^.Next;
end;
TeamTV := it;
end;
Procedure RestockRandomMonsters( GB: GameBoardPtr );
{ Replenish this level's supply of random monsters. }
var
Team: GearPtr;
TPV: LongInt;
DungeonStrength: Integer;
begin
{ Error check - make sure the scene is defined. }
if ( GB = Nil ) or ( GB^.Scene = Nil ) then Exit;
DungeonStrength := GB^.map_width * GB^.map_height div 10;
{ Search through the scene gear for teams which need random }
{ monsters. If they don't have enough PV, add some monsters. }
Team := GB^.Scene^.SubCom;
while Team <> Nil do begin
{ if this gear is a team, and it has a wandering monster }
{ allocation set, add some monsters. }
if ( Team^.G = GG_Team ) and ( Team^.STat[ STAT_WanderMon ] > 0 ) then begin
{ Calculate total point value of this team's units. }
TPV := TeamTV( GB^.Meks , Team^.S , Team^.Stat[ STAT_WanderMon ] );
if TPV < DungeonStrength then begin
AddRandomMonsters( GB , SAttValue( Team^.SA , 'TYPE' ) , Team^.S , Team^.Stat[ STAT_WanderMon ] , DungeonStrength - TPV , Random( 3 ) );
end;
end;
{ Move to the next gear. }
Team := Team^.Next;
end;
end;
Function MechaMatchesFaction( Mek: GearPtr; const Factions: String ): Boolean;
{ Return TRUE if this mecha matches one of the listed factions. }
begin
MechaMatchesFaction := PartAtLeastOneMatch( SAttValue( Mek^.SA , 'FACTIONS' ) , Factions );
end;
Function MechaMatchesFactionAndTerrain( Mek: GearPtr; const Factions,Terrain_Type: String ): Boolean;
{ Return TRUE if MEK is a legal design for the faction and map, }
{ or FALSE otherwise. }
begin
MechaMatchesFactionAndTerrain := ( Mek^.G = GG_Mecha ) and MechaMatchesFaction( Mek , Factions ) and PartMatchesCriteria( SAttValue( Mek^.SA , 'TYPE' ) , Terrain_Type );
end;
Function GenerateMechaList( MPV: LongInt; Fac: GearPtr; Factions,Desc,Unit_Type: String ): NAttPtr;
{ Build a list of mechas from the DESIGN diectory which have }
{ a maximum point value of MPV or less. }
{ FAC is the controlling faction. }
{ FACTIONS is the list of faction designations from which mecha may be chosen. }
{ DESC is the terrain description taken from the scene. }
{ UNIT_TYPE is the kind of unit being built. }
{ }
{ The shopping list will be a list of numeric attributes in this format: }
{ G = List position of mecha. }
{ S = Role of mecha, given the UNIT_TYPE. }
{ V = Value of mecha. }
Function MechaRole( Mek: GearPtr ): Integer;
{ Return the role of this mecha, given the faction and unit type. }
var
roles: String;
P: Integer;
begin
{ Error check- if no faction, no role. }
if Fac = Nil then Exit( 0 );
{ Obtain the proper ROLE string from the mecha. }
roles := UpCase( SAttValue( Mek^.SA , 'ROLE_' + SAttValue( Fac^.SA , 'DESIG' ) ) );
{ Next, locate the clause pertaining to this unit type. }
P := Pos( Unit_Type , roles );
if ( P <> 0 ) and ( Length( roles ) >= ( P + Length( Unit_Type ) + 2 ) ) then begin
Case roles[ P + Length( Unit_Type ) + 1 ] of
'T': P := ROLE_Trooper;
'S': P := ROLE_Support;
'C': P := ROLE_Command;
else P := 0;
end;
end;
MechaRole := P;
end;
var
it: NAttPtr;
Mek: GearPtr;
N,MinValFound,LVN: LongInt; { The lowest value found so far. }
LVMek: GearPtr; { Pointer to the lowest value mek. }
begin
it := Nil;
MinValFound := 0;
LVMek := Nil;
LVN := 0;
if unit_type = '' then unit_type := UTYPE_General;
{ All the meks are contained in the STANDARD_EQUIPMENT_LIST. }
Mek := Standard_Equipment_List;
N := 1;
while Mek <> Nil do begin
if ( Mek^.G = GG_Mecha ) then begin
if ( GearValue( Mek ) <= MPV ) and MechaMatchesFactionAndTerrain( Mek , Factions , DESC ) then begin
SetNAtt( it , N , MechaRole( Mek ) , GearValue( Mek ) );
end;
if ( ( GearValue( Mek ) < MinValFound ) or ( MinValFound = 0 ) ) and MechaMatchesFactionAndTerrain( Mek , Factions , DESC ) then begin
LVMek := Mek;
LVN := N;
MinValFound := GearValue( Mek );
end;
end;
Inc( N );
Mek := Mek^.Next;
end;
{ Error check- we don't want to return an empty list, }
{ but we will if we have to. }
if ( it = Nil ) and ( LVMek <> Nil ) then begin
SetNAtt( it , LVN , MechaRole( LVMek ) , GearValue( LVMek ) );
end;
GenerateMechaList := it;
end;
Function OptimalMechaValue( Renown: Integer ): LongInt;
{ Return the optimal mecha value for a grunt NPC fighting a character }
{ with the provided renown. }
const
MinOMV = 50000;
var
it: LongInt;
begin
it := Calculate_Threat_Points( Renown , 20 );
if it < MinOMV then it := MinOMV;
OptimalMechaValue := it;
end;
Function PurchaseForces( ShoppingList: NAttPtr; Renown,Strength: Integer; Fac: GearPtr ): GearPtr;
{ Pick a number of random meks. Add pilots to these meks. }
{ The expected PC skill level is measured by RENOWN. The difficulty of the }
{ encounter is measured by STRENGTH, which is a percentage with 100 representing }
{ an average fight. }
{ SHOPPINGLIST is a list of possible mecha from GenerateMechaList above. }
{ FAC is the faction these mecha belong to. }
{ Within this procedure it is assumed that 7 points of renown translate to one }
{ point of skill. That isn't necessarily true at the high and low ends of the spectrum, }
{ but it's a good heuristic. }
const
BasicGruntCost = 30;
SkillPlusCost = 15;
SkillMinusCost = 7;
SkillStep = 7; { The amount of Renown needed to change the skill rank. }
BasicEnemyRenownModifier = -20;
var
OptimalValue: LongInt; { The ideal value for a mecha. }
MList: GearPtr; { The list of mecha we will eventually return. }
Function ObtainMek( N: Integer ): GearPtr;
{ Clone mek N from the standard equipment list. }
begin
{ Clone the mecha we want. }
ObtainMek := CloneGear( RetrieveGearSib( Standard_Equipment_List , N ) );
end;
Function SelectNextMecha: Integer;
{ Select a mecha file to load. Try to make it appropriate }
{ to the point value of the encounter. }
var
M1,M2: NAttPtr;
T: Integer;
V,V2: LongInt;
begin
{ Select a mecha at random, and find out its point value. }
M1 := SelectRandomNAtt( ShoppingList );
V := M1^.V;
{ If the PV of this mecha seems a bit low, }
{ look for a more expensive model and maybe pick that }
{ one instead. }
if Strength >= BasicGruntCost then begin
t := 3;
while ( t > 0 ) and ( V < ( OptimalValue div 2 ) ) do begin
M2 := SelectRandomNAtt( ShoppingList );
V2 := M2^.V;
if V2 > V then begin
M1 := M2;
V := V2;
end;
Dec( T );
end;
end else begin
{ If STRENGTH is running out, select a small mecha instead. }
t := 2;
while ( t > 0 ) do begin
M2 := SelectRandomNAtt( ShoppingList );
V2 := M2^.V;
if V2 < V then begin
M1 := M2;
V := V2;
end;
Dec( T );
end;
end;
{ Return the info string selected. }
SelectNextMecha := M1^.G;
end;
Function SelectMechaByRole( Role,MaxCost: LongInt ): Integer;
{ Select a mecha based on the given role and maximum }
{ cost. If no legal mecha is found, return 0. }
type
smbr_ChoiceRec = Record
N: Integer;
Cost: LongInt;
end;
const
Num_Possible_Choices = 3;
var
Possible_Choices: Array [1..Num_Possible_Choices] of smbr_ChoiceRec;
T,N: Integer;
Mek: NAttPtr;
begin
{ Initialization. }
for t := 1 to Num_Possible_Choices do Possible_Choices[ t ].N := 0;
{ Step One: Create a list of up to 3 possibilities. }
Mek := ShoppingList;
N := 0;
while Mek <> Nil do begin
if ( Mek^.S = Role ) and ( Mek^.V <= MaxCost ) then begin
{ This mecha has the right role and a legal cost. }
{ Let's see if it's more expensive than what we currently }
{ have in the array. }
T := 1;
while ( T <= Num_Possible_Choices ) and ( Possible_Choices[ t ].Cost > Mek^.V ) do begin
Inc( T );
end;
if T <= Num_Possible_Choices then begin
Possible_Choices[ t ].N := Mek^.G;
Possible_Choices[ t ].Cost := Mek^.V;
if N < Num_Possible_Choices then Inc( N );
end;
end;
Mek := Mek^.Next;
end;
{ Step Two: If there are any choices, pick one at random. }
if N > 0 then begin
N := Possible_Choices[ Random( N ) + 1 ].N;
end;
SelectMechaByRole := N;
end;
Function MechaStrengthCost( MPV: LongInt ): LongInt;
{ Return the strength cost of this mecha, based on its value. }
var
it: LongInt;
begin
it := ( MPV * BasicGruntCost ) div OptimalValue;
if it < 5 then it := 5;
MechaStrengthCost := it;
end;
Procedure AddMechaToTeam( Mek: GearPtr; Lvl: Integer );
{ Add this mecha to the team, along with a pilot of the }
{ requested level. }
var
CP,Pilot: GearPtr;
begin
{DialogMsg( 'Adding ' + FullGearName( Mek ) + ' at R' + BStr( Lvl ) + ': ' + BStr( Strength ) );}
{ Add this mecha to our list. }
AppendGear( MList , Mek );
{ Create a pilot, add it to the mecha. }
CP := SeekGear( Mek , GG_CockPit , 0 );
if CP <> Nil then begin
Pilot := RandomPilot( 72 , 10 );
SetSkillsAtLevel( Pilot , Lvl );
InsertSubCom( CP , Pilot );
end;
end;
Procedure AddAUnit;
{ We are going to try to add an organized unit to this team. }
{ A unit consists of 2 to 6 identical troopers, 0 to 2 support, }
{ and 0 to 1 commander. }
{ STRENGTH should be at least 80 when calling this procedure. }
var
MekID,N,T,MaxNumberOfMeks,PilotLvl: Integer;
StrCost: LongInt; { The number of strength points this mecha will cost. }
Mek: GearPtr;
PilotBoost: Boolean;
begin
{ Step One: Decide on a good trooper mecha. }
MekID := SelectMechaByRole( ROLE_Trooper , OptimalValue * 3 div 2 );
PilotBoost := False;
if MekID > 0 then begin
StrCost := MechaStrengthCost( NAttValue( ShoppingList , MekID , ROLE_Trooper ) ) - SkillMinusCost;
PilotLvl := Renown + BasicEnemyRenownModifier - SkillStep;
if StrCost < 11 + Random( 10 ) then begin
PilotLvl := PilotLvl + SkillStep;
StrCost := StrCost + SkillMinusCost;
PilotBoost := True;
end;
MaxNumberOfMeks := Strength div StrCost;
if MaxNumberOfMeks > 8 then MaxNumberOfMeks := 8;
N := Random( 5 ) + Random( 5 ) + 2;
if N > MaxNumberOfMeks then N := MaxNumberOfMeks
else if N < ( MaxNumberOfMeks div 2 ) then N := MaxNumberOfMeks div 2;
for t := 1 to N do begin
Mek := ObtainMek( MekID );
{DialogMsg( 'TROOPER: ' + FullGearName( Mek ) );}
AddMechaToTeam( Mek , PilotLvl );
Strength := Strength - StrCost;
end;
{ Next, see about adding some support. }
if ( N > 1 ) and ( Strength > 40 ) and ( Random( 5 ) <> 1 ) then begin
MekID := SelectMechaByRole( ROLE_Support , OptimalValue * 3 div 2 );
if MekID > 0 then begin
StrCost := MechaStrengthCost( NAttValue( ShoppingList , MekID , ROLE_Support ) ) - SkillMinusCost;
PilotLvl := Renown + BasicEnemyRenownModifier - SkillStep;
{ If the troopers got a bonus, and we can afford a bonus here, dole one out. }
if PilotBoost and ( ( StrCost + SkillMinusCost ) <= Strength ) then begin
PilotLvl := PilotLvl + SkillStep;
StrCost := StrCost + SkillMinusCost;
end;
MaxNumberOfMeks := Strength div StrCost;
{ At this point in time, N should still equal the number of }
{ troopers generated. No more than half the unit may be support. }
if MaxNumberOfMeks > ( N div 2 ) then MaxNumberOfMeks := N div 2;
N := Random( MaxNumberOfMeks + 2 );
if N > MaxNumberOfMeks then N := MaxNumberOfMeks;
if N > 0 then begin
for t := 1 to N do begin
Mek := ObtainMek( MekID );
{DialogMsg( 'SUPPORT: ' + FullGearName( Mek ) );}
AddMechaToTeam( Mek , PilotLvl );
Strength := Strength - StrCost;
end;
end;
end;
end;
{ Finally, see about adding a commander. }
if ( Strength > ( 30 + Random( 20 ) ) ) and ( Random( 3 ) <> 1 ) then begin
MekID := SelectMechaByRole( ROLE_Command , OptimalValue * 2 );
if MekID > 0 then begin
StrCost := MechaStrengthCost( NAttValue( ShoppingList , MekID , ROLE_Command ) );
Mek := ObtainMek( MekID );
{DialogMsg( 'COMMAND: ' + FullGearName( Mek ) );}
{ The commander gets a skill bonus. }
AddMechaToTeam( Mek , Renown + BasicEnemyRenownModifier + Random( 10 ) );
Strength := Strength - StrCost - SkillPlusCost;
end;
end;
end;
end;
Procedure AssortedMechaExtravaganza;
{ We're done with that high-falootin' organized unit business. }
{ Spend the rest of our points on a random grab-bag of mecha. }
var
MPV: LongInt;
StrCost: LongInt; { The number of strength points this mecha will cost. }
Lvl,Bonus: LongInt; { Pilot level. }
CTheme,CPoints: Integer; { Customization theme and points. }
Mek: GearPtr;
begin
{ Keep processing until we run out of points. }
{ The points are represented by STRENGTH. }
while ( Strength > 0 ) and ( ShoppingList <> Nil ) do begin
{ Select a mek at random. }
{ Load & Clone the mek. }
Mek := ObtainMek( SelectNextMecha );
{ Determine its cash value. }
MPV := GearValue( Mek );
{ From this, we may determine its base STRENGTH value. }
StrCost := MechaStrengthCost( MPV );
{ If we have a lot of STRENGTH, and are at a sufficiently high RENOWN, consider }
{ making this mecha a custom model. }
if ( Strength > ( 150 + Random( 300 ) - Renown ) ) and ( StrCost < Random( 40 ) ) and ( Renown > ( 60 + Random( 50 ) ) ) then begin
{ Encountering a custom mecha in the RPG campaign is like finding }
{ a shiny pokemon, except actually useful. }
if Fac <> Nil then CTheme := NAttValue( Fac^.NA , NAG_Narrative , NAS_DefaultFacTheme )
else CTheme := 0;
CPoints := 2 + Random( 2 );
if StrCost < 25 then CPoints := CPoints + Random( 4 );
StrCost := StrCost + CPoints * 3;
MechaMakeover( Mek , Random( 3 ) + 1 , CTheme , CPoints );
end;
{ Select a pilot skill level. }
{ Base pilot level is 20 beneath the PC's renown. }
Lvl := Renown + BasicEnemyRenownModifier;
{ This level may be adjusted up or down depending on the mecha's cost. }
if StrCost > Strength then begin
{ We've gone overbudget. Whack this mecha's pilot. }
Lvl := Lvl - ( StrCost - Strength );
StrCost := Strength;
end else if ( ( StrCost * 3 ) < Strength ) and ( Strength > 90 ) and ( Random( 3 ) <> 1 ) then begin
{ We have plenty of points to spare. Give this pilot some lovin'. }
Bonus := Random( 3 ) + 1;
Lvl := Lvl + Bonus * SkillStep;
StrCost := StrCost + Bonus * SkillPlusCost;
end else if ( StrCost > ( BasicGruntCost + 1 + Random( 20 ) ) ) and ( Strength < ( 76 + Random( 175 ) ) ) then begin
{ Slightly overbudget... can reduce the cost with skill reduction. }
{ Note that we won't be reducing skills at all if STRENGTH is }
{ sufficiently high. }
Bonus := Random( 4 );
Lvl := Lvl - Bonus * SkillStep;
StrCost := StrCost - Bonus * SkillMinusCost;
end else if StrCost < ( BasicGruntCost - 1 - Random( 15 ) ) then begin
{ Underbudget... we can afford a better pilot. }
Bonus := Random( 3 );
if Random( 10 ) = 4 then Inc( Bonus );
Lvl := Lvl + Bonus * SkillStep;
StrCost := StrCost + Bonus * SkillPlusCost;
end;
{ If Strength is extremely high, maybe give an extra skill point }
{ in order to increase the cost. This extra skill point costs more than }
{ the above, since it can potentially raise the pilot to named-NPC-like }
{ status. }
if ( Strength > ( 201 + Random( 300 ) ) ) and ( Strength > ( StrCost * 3 ) ) then begin
Lvl := Lvl + SkillStep;
StrCost := StrCost + SkillPlusCost * 2;
end;
AddMechaToTeam( Mek , Lvl );
{ Reduce UPV by an appropriate amount. }
Strength := Strength - StrCost;
end;
end;
begin
{ Initialize our list to Nil. }
MList := Nil;
{ Record the optimal mecha value. }
OptimalValue := OptimalMechaValue( Renown );
if Strength > 80 then AddAUnit;
if Strength > 0 then AssortedMechaExtravaganza;
PurchaseForces := MList;
end;
Procedure AddTeamForces( GB: GameBoardPtr; TeamID,Renown,Strength: Integer );
{ Add forces to the gameboard. }
{ RENOWN is the expected renown of the player's team. }
{ STRENGTH is the difficulty level of this fight expressed as a percent. }
var
SList: NAttPtr;
MList,Mek,Pilot: GearPtr;
desc,fdesc,unit_type: String;
team,fac,LFac,rscene: GearPtr;
MaxMekShare,MPV: LongInt;
begin
{ First, generate the mecha description. }
{ GENERAL mecha are always welcome. }
fdesc := 'GENERAL';
team := LocateTeam( GB , TeamID );
if team <> Nil then begin
Fac := SeekFaction( GB^.Scene , NAttValue( Team^.NA , NAG_Personal , NAS_FactionID ) );
if Fac <> Nil then fdesc := fdesc + ' ' + SAttValue( Fac^.SA , 'DESIG' );
{ The unit_type is also stored in the team. }
unit_type := SAttValue( team^.SA , 'TYPE' );
end else begin
unit_type := '';
end;
{ Also add the terrain description from the scene. }
desc := '';
if GB^.Scene <> Nil then begin
desc := desc + ' ' + SAttValue( GB^.Scene^.SA , 'TERRAIN' );
{ Also locate the faction of the root scene; this will give the "generic" }
{ mecha for this particular region. }
if Fac = Nil then begin
rscene := FindRootScene( GB^.Scene );
if rscene <> Nil then begin
LFac := SeekFaction( GB^.Scene , NAttValue( RScene^.NA , NAG_Personal , NAS_FactionID ) );
if LFac <> Nil then fdesc := fdesc + ' ' + SAttValue( LFac^.SA , 'DESIG' );
end;
end;
end;
{ Generate the list of mecha. }
if Strength < 202 then MaxMekShare := 200
else MaxMekShare := ( Strength div 2 ) + 100;
MPV := ( OptimalMechaValue( Renown ) * MaxMekShare ) div 100;
if MPV < 300000 then MPV := 300000;
SList := GenerateMechaList( MPV , fac , fdesc , desc , unit_type );
{ Generate the mecha list. }
MList := PurchaseForces( SList , Renown , Strength , Fac );
{ Get rid of the shopping list. }
DisposeNAtt( SList );
{ Deploy the mecha on the map. }
while MList <> Nil do begin
{ Delink the first gear from the list. }
Mek := MList;
Pilot := LocatePilot( Mek );
DelinkGear( MList , Mek );
{ Set its team to the requested value. }
SetNAtt( Mek^.NA , NAG_Location , NAS_Team , TeamID );
if Pilot <> Nil then SetNAtt( Pilot^.NA , NAG_Location , NAS_Team , TeamID );
{ Designate both mecha and pilot as temporary. }
SetNAtt( Mek^.NA , NAG_EpisodeData , NAS_Temporary , 1 );
if Pilot <> Nil then begin
SetNAtt( Pilot^.NA , NAG_EpisodeData , NAS_Temporary , 1 );
end;
{ Mark the mecha as salvage- if the PC recovers it, it won't have }
{ a very high resale price. }
MarkGearsWithNAtt( Mek , NAG_GearOps , NAS_CostAdjust , -90 );
MarkGearsWithSAtt( Mek , 'SALETAG <' + MSgString( 'SALETAG_Salvage' ) + '>' );
{ Place it on the map. }
DeployGear( GB , Mek , True );
end;
end;
Function SelectNPCMecha( GB: GameBoardPtr; Scene,NPC: GearPtr ): GearPtr;
{ Select a mecha for the provided NPC. }
{ This mecha must match the NPC's faction, renown, and must also be legal for }
{ this game board. }
Function SelectMechaByValue( LList: GearPtr ): GearPtr;
{ We now have a list of mecha. Select one of them from the list, with }
{ emphasis given to the most expensive one there. }
var
m,mek: GearPtr;
Total: Int64;
begin
m := LList;
mek := Nil;
Total := 0;
while M <> nil do begin
Total := Total + GearValue( M );
m := m^.next;
end;
Total := Random( Total );
m := LList;
while ( Total >= 0 ) and ( m <> Nil ) do begin
Total := Total - GearValue( M );
if Total < 0 then Mek := M;
M := M^.Next;
end;
SelectMechaByValue := mek;
end;
const
Min_Max_Cost = 400000;
Max_Min_Cost = 1000000;
var
MechaList: GearPtr;
Factions,Terrain_Type: String;
Renown: LongInt;
SRec: SearchRec;
M,M2,Fac,DList,RScene: GearPtr;
Cost,Minimum_Cost, Maximum_Cost: LongInt;
begin
MechaList := Nil;
Renown := NAttValue( NPC^.NA , NAG_CharDescription , NAS_Renowned );
{ Determine the factions to be used by the NPC. }
Fac := SeekCurrentLevelGear( Factions_List , GG_Faction , NAttValue( NPC^.NA , NAG_Personal , NAS_FactionID ) );
Factions := 'GENERAL';
if Fac <> Nil then Factions := Factions + ' ' + SAttValue( Fac^.SA , 'DESIG' )
else begin
rscene := FindRootScene( Scene );
if rscene <> Nil then begin
Fac := SeekCurrentLevelGear( Factions_List , GG_Faction , NAttValue( RScene^.NA , NAG_Personal , NAS_FactionID ) );
if Fac <> Nil then factions := factions + ' ' + SAttValue( Fac^.SA , 'DESIG' );
end;
end;
{ Determine the terrain type to be used. }
if ( Scene <> Nil ) then Terrain_Type := SAttValue( Scene^.SA , 'TERRAIN' )
else Terrain_Type := 'GROUND';
{ Determine the maximum and minimum mecha costs. }
Maximum_Cost := OptimalMechaValue( Renown ) * 4;
if Maximum_Cost < Min_Max_Cost then Maximum_Cost := Min_Max_Cost;
Minimum_Cost := Maximum_Cost div 3;
if Minimum_Cost > Max_Min_Cost then Minimum_Cost := Max_Min_Cost;
{ Start the search process going... }
FindFirst( Design_Directory + Default_Search_Pattern , AnyFile , SRec );
{ As long as there are files which match our description, }
{ process them. }
While DosError = 0 do begin
{ Load this mecha design file from disk. }
DList := LoadFile( SRec.Name , Design_Directory );
{ Look through this list for mecha to use. }
M := DList;
while M <> Nil do begin
M2 := M^.Next;
if MechaMatchesFactionAndTerrain( M , Factions , Terrain_Type ) then begin
Cost := GearValue( M );
if ( Cost >= Minimum_Cost ) and ( Cost <= Maximum_Cost ) then begin
{ This is a legal mecha, usable in this terrain, and }
{ within our price range. Add it to the list. }
DelinkGear( DList , M );
AppendGear( MechaList , M );
end;
end;
M := M2;
end;
{ Dispose of the design list. }
DisposeGear( DList );
{ Look for the next file in the directory. }
FindNext( SRec );
end;
{ By now, we should have a mecha list full of candidates. If not, we better load }
{ something generic and junky. }
if MechaList <> Nil then begin
M := SelectMechaByValue( MechaList );
DelinkGear( MechaList , M );
DisposeGear( MechaList );
end else begin
DialogMsg( GearName( NPC ) + ' is forced to take a crappy mecha...' + Terrain_Type + ' ' + Factions + BStr( Minimum_Cost ) + ' - ' + Bstr( Maximum_Cost ) );
M := LoadSingleMecha( 'buruburu.txt' , Design_Directory );
end;
if XXRan_Debug then DialogMsg( 'Mecha for ' + GearName( NPC ) + ' [' + Bstr( Renown ) + '] ($' + BStr( Minimum_Cost ) + '-$' + BStr( Maximum_Cost ) + '): ' + GearName( M ) + ' ($' + Bstr( GearValue( M ) ) + ')' );
SelectNPCMecha := M;
end;
Procedure SelectEquipmentForNPC( GB: GameBoardPtr; NPC: GearPtr; Renown: Integer );
{ This procedure will select some decent equipment for the given NPC from the standard }
{ equipment list. Faction will be taken into account. }
{ Many of these procedures will rely upon a special kind of shopping list }
{ composed of numeric attributes. }
{ SHOPPING LIST }
{ G = Item index in Standard_Equipment_List }
{ S = Undefined }
{ V = Item "goodness"- basically cost plus a bonus for appropriateness }
var
Faction_Desc: String;
Spending_Limit,Legality_Limit: LongInt;
Function ItemLegalForFaction( I: GearPtr ): Boolean;
{ Return TRUE if this item can be used by the NPC's faction, or FALSE }
{ otherwise. }
{ This function uses the FACTION_DESC string, so better initialize it }
{ before calling this one. }
begin
ItemLegalForFaction := PartAtLeastOneMatch( SAttValue( I^.SA , 'FACTIONS' ) , Faction_Desc ) and ( NAttValue( I^.NA , NAG_GearOps , NAS_Legality ) <= Legality_Limit );
end;
Procedure AddToShoppingList( var ShoppingList: NAttPtr; Item: GearPtr; N: Integer );
{ Calculate this item's desirability and add it to the list. }
var
Desi: LongInt; { Short for desirability. }
begin
Desi := GearValue( Item );
{ If this item is limited to certain factions, it gets extra desirability. }
if not AStringHasBString( SAttValue( Item^.SA , 'FACTIONS' ) , 'GENERAL' ) then Desi := ( Desi * 5 ) div 4;
SetNAtt( ShoppingList , N , 0 , Desi );
end;
Procedure EquipItem( Slot , Item: GearPtr );
{ This is the real equipping procedure. Stuff ITEM into SLOT. }
{ As noted in TheRules.txt, any nonmaster gear can only have one }
{ item of any particular "G" type equipped at a time. So, if }
{ SLOT already has equipment of type ITEM^.G, unequip that and }
{ stuff it into PC's general inventory. }
var
I2,I3: GearPtr;
begin
{ First, check for already equipped items. }
I2 := Slot^.InvCom;
while I2 <> Nil do begin
I3 := I2^.Next; { This next step might delink I2, so... }
if ( I2^.G = Item^.G ) or ( Slot^.G = GG_Holder ) then begin
if NAttValue( I2^.NA , NAG_Narrative , NAS_IsRandomEquipment ) <> 0 then begin
RemoveGear( Slot^.InvCom , I2 );
end else begin
DelinkGear( Slot^.InvCom , I2 );
InsertInvCom( NPC , I2 );
end;
end;
I2 := I3;
end;
{ Mark ITEM as being generated randomly. }
SetNAtt( Item^.NA , NAG_Narrative , NAS_IsRandomEquipment , 1 );
{ We can now link ITEM into SLOT. }
InsertInvCom( Slot , Item );
end;
Function SelectItemForNPC( ShoppingList: NAttPtr ): GearPtr;
{ Considering this shopping list, select an item for the NPC }
{ based on the listed desirabilities. Then, locate the item }
{ referred to in the master item list, clone it, and return the }
{ copy. Hooray! }
var
SLI: NAttPtr;
Total: Int64;
N: Integer;
Item: GearPtr;
begin
{ Quick way out- if this list is empty, no sense in doing any real }
{ work, is there? }
if ShoppingList = Nil then Exit( Nil );
{ To start, go through the list and count up how many }
{ points we'll be dealing with. }
{ Quadratic weighting didn't work so well- back to linear. }
Total := 0;
SLI := ShoppingList;
while SLI <> Nil do begin
Total := Total + SLI^.V;
{ Total := Total + ( SLI^.V * SLI^.V );}
SLI := SLI^.Next;
end;
{ Next, go through one more time and pick one randomly. }
Total := Random( Total );
SLI := ShoppingList;
N := 0;
while ( N = 0 ) and ( SLI <> Nil ) do begin