-
Notifications
You must be signed in to change notification settings - Fork 4
/
ai.c
8915 lines (7349 loc) · 189 KB
/
ai.c
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
/*
* Race for the Galaxy AI
*
* Copyright (C) 2009-2011 Keldon Jones
*
* Source file modified by B. Nordli, August 2014.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "rftg.h"
#include "net.h"
/* #define DEBUG */
/*
* Track number of times neural net is computed.
*/
static int num_computes;
/*
* A neural net for evaluating hand and active cards.
*/
static net eval;
/*
* A neural net for predicting role choices.
*/
static net role;
/*
* Counters for tracking usefulness of role prediction.
*/
static int role_hit, role_miss;
static double role_avg;
#ifdef EVAL_CACHE
static int eval_cache_hit, eval_cache_miss;
#endif
/*
* Size of evaluator neural net.
*/
#define EVAL_HIDDEN 50
/*
* Size of role predictor neural net.
*/
#define ROLE_HIDDEN 50
/*
* Number of outputs for role predictor network (basic and advanced).
*/
#define ROLE_OUT 7
#define ROLE_OUT_ADV 23
#define ROLE_OUT_EXP3 15
#define ROLE_OUT_ADV_EXP3 76
/*
* Amount of current turn to complete simulation of.
*/
#define COMPLETE_ROUND 0
#define COMPLETE_CHECK 1
#define COMPLETE_DEVSET 2
/*
* Items to count per player to determine leader and amount behind.
*/
#define LEADER_VP 0
#define LEADER_PRESTIGE 1
#define LEADER_BUILT 2
#define LEADER_CARDS 3
#define LEADER_GOODS 4
#define MAX_LEADER 5
/*
* Forward declaration.
*/
static void initial_training(game *g);
static void setup_nets(game *g);
static void fill_adv_combo(void);
/*
* Initialize AI.
*/
static void ai_initialize(game *g, int who, double factor)
{
char fname[1024], msg[1024];
static int loaded_p, loaded_e, loaded_a;
/* Create table of advanced action combinations */
fill_adv_combo();
/* Do nothing if correct networks already loaded */
if (loaded_p == g->num_players && loaded_e == g->expanded &&
loaded_a == g->advanced) return;
/* Free old networks if some already loaded */
if (loaded_p > 0)
{
/* Free old networks */
free_net(&eval);
free_net(&role);
}
/* Compute size and input names of networks */
setup_nets(g);
/* Set learning rate */
eval.alpha = 0.0001 * factor;
#ifdef DEBUG
eval.alpha = 0.0;
#endif
/* Create evaluator filename */
sprintf(fname, RFTGDIR "/network/rftg.eval.%d.%d%s.net", g->expanded,
g->num_players, g->advanced ? "a" : "");
/* Attempt to load network weights from disk */
if (load_net(&eval, fname))
{
/* Try looking under current directory */
sprintf(fname, "network/rftg.eval.%d.%d%s.net", g->expanded,
g->num_players, g->advanced ? "a" : "");
/* Attempt to load again */
if (load_net(&eval, fname))
{
/* Print warning */
sprintf(msg, "Warning: Couldn't open %s\n", fname);
display_error(msg);
/* Randomize initial weights */
random_net(&eval);
/* Perform initial training on new network */
initial_training(g);
}
}
/* Set learning rate */
role.alpha = 0.0005 * factor;
#ifdef DEBUG
role.alpha = 0.0;
#endif
/* Create predictor filename */
sprintf(fname, RFTGDIR "/network/rftg.role.%d.%d%s.net", g->expanded,
g->num_players, g->advanced ? "a" : "");
/* Attempt to load network weights from disk */
if (load_net(&role, fname))
{
/* Try looking under current directory */
sprintf(fname, "network/rftg.role.%d.%d%s.net", g->expanded,
g->num_players, g->advanced ? "a" : "");
/* Attempt to load again */
if (load_net(&role, fname))
{
/* Print warning */
sprintf(msg, "Warning: Couldn't open %s\n", fname);
display_error(msg);
/* Randomize initial weights */
random_net(&role);
}
}
/* Mark network as loaded */
loaded_p = g->num_players;
loaded_e = g->expanded;
loaded_a = g->advanced;
}
/*
* Called when player spots have been rotated.
*
* We need to do nothing.
*/
static void ai_notify_rotation(game *g, int who)
{
}
/*
* Copy the game state to a temporary copy so that we can simulate the future.
*/
static void simulate_game(game *sim, game *orig, int who)
{
int i;
/* Copy game */
memcpy(sim, orig, sizeof(game));
/* Loop over players */
for (i = 0; i < sim->num_players; i++)
{
/* Move choice log position to end */
sim->p[i].choice_pos = sim->p[i].choice_size;
}
/* Check for first-level simulation */
if (!sim->simulation)
{
/* Set simulation flag */
sim->simulation = 1;
/* Lose real random seed */
sim->random_seed = 1;
/* Remember whose point-of-view to use */
sim->sim_who = who;
/* Loop over players */
for (i = 0; i < sim->num_players; i++)
{
/* Set action functions to AI */
sim->p[i].control = &ai_func;
}
}
}
/*
* Structure holding most discardable cards.
*
* A list of these is created at the start of each round for each AI
* player, and used to quickly determine which cards will no longer
* be in the hand at the end of the round.
*/
typedef struct quick_discard
{
/* Card index */
int which;
/* Score without this card */
double score;
} quick_discard;
/*
* List of most discardable cards (per player).
*/
quick_discard discard_list[MAX_PLAYER][MAX_DECK];
/*
* Compare two quick discard entries.
*/
static int cmp_quick_discard(const void *a, const void *b)
{
quick_discard *q_ptr, *r_ptr;
/* Cast pointers */
q_ptr = (quick_discard *)a;
r_ptr = (quick_discard *)b;
/* Compare scores */
return r_ptr->score > q_ptr->score ? 1 : -1;
}
/*
* Quick-discard the given number of cards.
*/
static void ai_quick_discard(game *g, int who, int amt)
{
int i, x, n = 0;
/* Loop until discards are satisfied */
for (i = 0; n < amt; i++)
{
/* Get card */
x = discard_list[who][i].which;
/* XXX Check for running off end of list */
if (x < 0) break;
/* Check for no longer in hand */
if (g->deck[x].owner != who || g->deck[x].where != WHERE_HAND)
{
/* Go to next card */
continue;
}
/* Discard */
move_card(g, x, -1, WHERE_DISCARD);
/* Count cards discarded */
n++;
/* Reduce fake discards */
g->p[who].fake_discards--;
}
}
/*
* Complete the current turn.
*
* We call this before evaluating a game state, to attempt to foresee
* consequences of chosen actions.
*/
static void complete_turn(game *g, int partial)
{
player *p_ptr;
int i, target;
/* Ensure game is simulated */
if (!g->simulation)
{
/* Error */
display_error("complete_turn() called with real game!\n");
abort();
}
/* Do nothing in aborted games */
if (g->game_over) return;
/* Finish current phase */
for (i = g->turn + 1; i < g->num_players; i++)
{
/* Get player pointer */
p_ptr = &g->p[i];
/* Set turn */
g->turn = i;
/* Check for consume phase */
if (g->cur_action == ACT_CONSUME_TRADE)
{
/* Check for consume-trade chosen */
if (player_chose(g, i, ACT_CONSUME_TRADE))
{
/* Trade a good */
trade_action(g, i, 0, 1);
}
/* Use consume powers until none are available */
while (consume_action(g, i));
}
/* Check for produce phase */
if (g->cur_action == ACT_PRODUCE)
{
/* Use produce phase powers */
while (produce_action(g, i));
}
}
/* Resolve any pending takeovers */
if (g->cur_action == ACT_SETTLE || g->cur_action == ACT_SETTLE2)
resolve_takeovers(g);
/* Use final produce powers */
if (g->cur_action == ACT_PRODUCE) phase_produce_end(g);
/* Clear temp flags from just-finished phase */
clear_temp(g);
/* Check goals from just-finished phase */
check_goals(g);
/* Check prestige from just-finished phase */
check_prestige(g);
/* Loop over remaining phases */
for (i = g->cur_action + 1; i <= ACT_PRODUCE; i++)
{
/* Check for stop after develop/settle */
if (partial == COMPLETE_DEVSET && i >= ACT_CONSUME_TRADE)
{
/* Stop simulation */
break;
}
/* Check for only completing one phase */
if (partial == COMPLETE_CHECK) break;
/* Set game phase */
g->cur_action = i;
/* Skip unselected actions */
if (!g->action_selected[i]) continue;
/* Handle phase */
switch (i)
{
case ACT_SEARCH: phase_search(g); break;
case ACT_EXPLORE_5_0: phase_explore(g); break;
case ACT_DEVELOP:
case ACT_DEVELOP2: phase_develop(g); break;
case ACT_SETTLE:
case ACT_SETTLE2: phase_settle(g); break;
case ACT_CONSUME_TRADE: phase_consume(g); break;
case ACT_PRODUCE: phase_produce(g); break;
}
}
/* End of round */
g->cur_action = ACT_ROUND_END;
/* Handle discard phase */
if (partial == COMPLETE_ROUND) phase_discard(g);
/* Check intermediate goals */
if (partial == COMPLETE_ROUND) check_goals(g);
/* Check for game end */
if (g->vp_pool <= 0) g->game_over = 1;
/* Check for full table */
for (i = 0; i < g->num_players; i++)
{
/* Get player pointer */
p_ptr = &g->p[i];
/* Assume player needs 12 cards to end game */
target = 12;
/* Check for "game ends at 14" flag */
if (count_active_flags(g, i, FLAG_GAME_END_14)) target = 14;
/* Check for enough cards */
if (count_player_area(g, i, WHERE_ACTIVE) >= target)
{
/* Game over */
g->game_over = 1;
}
/* Check for enough prestige to end game */
if (p_ptr->prestige >= 15) g->game_over = 1;
}
/* Handle beginning of next round if possible */
if (!g->game_over && partial == COMPLETE_ROUND)
{
/* Award prestige bonuses */
start_prestige(g);
/* Get player pointer of simulating player */
p_ptr = &g->p[g->sim_who];
/* Count cards still believed to be in hand */
target = count_player_area(g, g->sim_who, WHERE_HAND);
/* Check for cards discarded */
if (p_ptr->low_hand < target)
{
/* Discard cards to make up difference */
ai_quick_discard(g, g->sim_who,
target - p_ptr->low_hand);
}
}
}
/*
* Score a consume power for consume_ability().
*
* This actually returns VP * 100, to avoid floating point math.
*/
static int consume_vp(power *o_ptr)
{
int vp, cost;
int score;
/* Get VP worth of power */
vp = o_ptr->value;
/* Assume 1 good consumed */
cost = 1;
/* Check for consume two */
if (o_ptr->code & P4_CONSUME_TWO) cost = 2;
/* Check for consume three */
if (o_ptr->code & P4_CONSUME_3_DIFF) cost = 3;
/* Check for consume all remaining */
if (o_ptr->code & P4_CONSUME_ALL)
{
/* Assume 3 goods remain */
vp = 2;
cost = 3;
}
/* Compute basic score */
score = vp * 100 / cost;
/* Slightly penalize generic consume powers */
if (o_ptr->code & P4_CONSUME_ANY) score--;
/* Return score */
return score;
}
/*
* Sort two consume powers by number of VPs/good they return.
*
* If they are equal, sort specific-type powers before general ones.
*/
static int cmp_consume(const void *a, const void *b)
{
power_where *w_ptr, *x_ptr;
/* Cast pointers */
w_ptr = (power_where *)a;
x_ptr = (power_where *)b;
/* Score powers */
return consume_vp(x_ptr->o_ptr) - consume_vp(w_ptr->o_ptr);
}
/*
* Determine the amount of consume/produce power a player has.
*
* This is roughly equal to the amount of VPs earned from Consume
* powers that have a matching production world.
*
* We also count as production worlds any windfall worlds with a
* matching "produce on windfall" power.
*
* If "produce" is false, return amount of VPs earnable with current
* goods on worlds.
*/
static int consume_ability(game *g, int who, int produce)
{
player *p_ptr;
card *c_ptr;
design *d_ptr;
power *o_ptr;
power_where w_list[100];
int i, j, k, x, n = 0;
int consume_goods[6], produce_goods[6];
int windfall_world[6], windfall_power[6];
int total_goods, good_types;
int good, cost, progress, count = 0;
int hand_size, prestige_avail;
/* Get player pointer */
p_ptr = &g->p[who];
/* Clear good type arrays */
for (i = 0; i <= GOOD_ALIEN; i++)
{
/* Clear arrays */
consume_goods[i] = 0;
produce_goods[i] = 0;
windfall_world[i] = 0;
windfall_power[i] = 0;
}
/* Count hand size */
hand_size = count_player_area(g, who, WHERE_HAND) + p_ptr->fake_hand -
p_ptr->fake_discards;
/* Remember available prestige */
prestige_avail = p_ptr->prestige;
/* Start at player's first active card */
x = p_ptr->head[WHERE_ACTIVE];
/* Loop over active cards */
for ( ; x != -1; x = g->deck[x].next)
{
/* Get card pointer */
c_ptr = &g->deck[x];
/* Get design pointer */
d_ptr = c_ptr->d_ptr;
/* Check for windfall world */
if (d_ptr->flags & FLAG_WINDFALL)
{
/* Add to count of windfall worlds */
windfall_world[d_ptr->good_type]++;
}
/* Check for goods on world */
if (!produce && c_ptr->num_goods)
{
/* Count goods */
produce_goods[d_ptr->good_type] += c_ptr->num_goods;
}
/* Loop over powers on card */
for (i = 0; i < d_ptr->num_power; i++)
{
/* Get power pointer */
o_ptr = &d_ptr->powers[i];
/* Check for Consume power */
if (o_ptr->phase == PHASE_CONSUME)
{
/* Chcek for free VP */
if (o_ptr->code & P4_VP)
{
/* Just add to count */
count += o_ptr->value;
continue;
}
/* Skip powers that don't give VP */
if (!(o_ptr->code & P4_GET_VP)) continue;
/* Check for powers that don't consume goods */
if (o_ptr->code & (P4_DISCARD_HAND |
P4_CONSUME_PRESTIGE))
{
/* Skip if not checking immediate */
if (!produce) continue;
/* Check for discarding from hand */
if (o_ptr->code & P4_DISCARD_HAND)
{
/* Check for sufficient cards */
if (hand_size >= o_ptr->times)
{
/* Add to count */
count += o_ptr->times;
hand_size-=o_ptr->times;
}
}
/* Check for consuming prestige */
if (o_ptr->code & P4_CONSUME_PRESTIGE)
{
/* Check for sufficient */
if (prestige_avail)
{
/* Add to count */
count += o_ptr->value;
prestige_avail--;
}
}
/* Next power */
continue;
}
/* Assume one good consumed */
cost = 1;
/* Check for two */
if (o_ptr->code & P4_CONSUME_TWO) cost = 2;
/* Add power to list */
w_list[n].c_idx = x;
w_list[n].o_idx = i;
w_list[n].o_ptr = o_ptr;
n++;
/* Check for specific type required */
if (o_ptr->code & P4_CONSUME_NOVELTY)
consume_goods[GOOD_NOVELTY] += cost;
if (o_ptr->code & P4_CONSUME_RARE)
consume_goods[GOOD_RARE] += cost;
if (o_ptr->code & P4_CONSUME_GENE)
consume_goods[GOOD_GENE] += cost;
if (o_ptr->code & P4_CONSUME_ALIEN)
consume_goods[GOOD_ALIEN] += cost;
/* Check for multiple types consumed */
if (o_ptr->code & (P4_CONSUME_3_DIFF |
P4_CONSUME_N_DIFF))
{
/* All types required */
consume_goods[GOOD_NOVELTY]++;
consume_goods[GOOD_RARE]++;
consume_goods[GOOD_GENE]++;
consume_goods[GOOD_ALIEN]++;
}
}
/* Skip produce powers if just checking goods */
if (!produce) continue;
/* Check for Produce power */
if (o_ptr->phase == PHASE_PRODUCE)
{
/* Check for basic produce power */
if (o_ptr->code & P5_PRODUCE)
{
/* Count goods produced */
produce_goods[d_ptr->good_type]++;
continue;
}
/* Skip powers that require discarding */
if (o_ptr->code & P5_DISCARD) continue;
/* Check for windfall production powers */
if (o_ptr->code & P5_WINDFALL_ANY)
windfall_power[GOOD_ANY]++;
if (o_ptr->code & P5_WINDFALL_NOVELTY)
windfall_power[GOOD_NOVELTY]++;
if (o_ptr->code & P5_WINDFALL_RARE)
windfall_power[GOOD_RARE]++;
if (o_ptr->code & P5_WINDFALL_GENE)
windfall_power[GOOD_GENE]++;
if (o_ptr->code & P5_WINDFALL_ALIEN)
windfall_power[GOOD_ALIEN]++;
}
}
}
/* Assume produce phase bonus is used */
if (produce) windfall_power[GOOD_ANY]++;
/* Convert windfall powers to good production */
for (i = GOOD_ANY; i <= GOOD_ALIEN; i++)
{
/* Skip good types with no powers or worlds */
if (!windfall_world[i]) continue;
if (!windfall_power[i]) continue;
/* Check for more windfall powers than worlds */
if (windfall_power[i] > windfall_world[i])
{
/* Convert all windfall worlds to production */
produce_goods[i] += windfall_world[i];
windfall_power[i] -= windfall_world[i];
windfall_world[i] = 0;
}
else
{
/* Convert all windfall powers to production */
produce_goods[i] += windfall_power[i];
windfall_world[i] -= windfall_power[i];
windfall_power[i] = 0;
}
}
/* Run loop at least once */
progress = 1;
/* Convert "any" windfall production to normal */
while (windfall_power[GOOD_ANY] > 0 && progress)
{
/* Assume no progress will be made */
progress = 0;
/* Loop over types */
for (i = GOOD_NOVELTY; i <= GOOD_ALIEN; i++)
{
/* Check for no windfall worlds of this type */
if (!windfall_world[i]) continue;
/* Check for no more worlds of this type needed */
if (consume_goods[i] <= produce_goods[i]) continue;
/* Use one any windfall power on this type */
windfall_power[GOOD_ANY]--;
produce_goods[i]++;
windfall_world[i]--;
/* Progress made */
progress = 1;
/* Stop looking */
break;
}
}
/* Run loop at least once */
progress = 1;
/* Convert "any" windfall production to normal */
while (windfall_power[GOOD_ANY] > 0 && progress)
{
/* Assume no progress will be made */
progress = 0;
/* Loop over types */
for (i = GOOD_NOVELTY; i <= GOOD_ALIEN; i++)
{
/* Check for no windfall worlds of this type */
if (!windfall_world[i]) continue;
/* Use one any windfall power on this type */
windfall_power[GOOD_ANY]--;
produce_goods[i]++;
windfall_world[i]--;
/* Progress made */
progress = 1;
/* Stop looking */
break;
}
}
/* Sort consume powers by score */
qsort(w_list, n, sizeof(power_where), cmp_consume);
/* Loop over consume powers, best first */
for (i = 0; i < n; i++)
{
/* Get power pointer */
o_ptr = w_list[i].o_ptr;
/* Loop over power a number of times */
for (j = 0; j < o_ptr->times; j++)
{
/* Assume one good consumed */
cost = 1;
/* Check for two */
if (o_ptr->code & P4_CONSUME_TWO) cost = 2;
/* No good type */
good = 0;
/* Check for specific consume type */
if (o_ptr->code & P4_CONSUME_NOVELTY)
good = GOOD_NOVELTY;
if (o_ptr->code & P4_CONSUME_RARE)
good = GOOD_RARE;
if (o_ptr->code & P4_CONSUME_GENE)
good = GOOD_GENE;
if (o_ptr->code & P4_CONSUME_ALIEN)
good = GOOD_ALIEN;
/* Check for goods available */
if (good && produce_goods[good] >= cost)
{
/* Award points and use goods */
count += o_ptr->value;
produce_goods[good] -= cost;
consume_goods[good] -= cost;
continue;
}
/* Check for insufficient goods */
if (good) break;
/* Assume no goods or good types */
total_goods = good_types = 0;
/* Loop over types */
for (k = GOOD_NOVELTY; k <= GOOD_ALIEN; k++)
{
/* Add goods to total */
total_goods += produce_goods[k];
/* Check for type available */
if (produce_goods[k]) good_types++;
}
/* Check for consume any goods */
if (o_ptr->code & P4_CONSUME_ANY)
{
/* Check for insufficient goods */
if (total_goods < cost) break;
/* Loop over types */
for (k = GOOD_NOVELTY; k <= GOOD_ALIEN; k++)
{
/* Skip unavailable types */
if (!produce_goods[k]) continue;
/* Skip good types needed later */
if (consume_goods[k]) continue;
/* Use a good */
produce_goods[k]--;
cost--;
/* Check for done */
if (!cost) break;
/* Recheck this type */
k--;
}
/* Loop over types */
for (k = GOOD_NOVELTY; k <= GOOD_ALIEN; k++)
{
/* Check for done */
if (!cost) break;
/* Skip unavailable types */
if (!produce_goods[k]) continue;
/* Use a good */
produce_goods[k]--;
cost--;
/* Check for done */
if (!cost) break;
/* Recheck this type */
k--;
}
/* Award VPs */
count += o_ptr->value;
}
/* Check for consume 3 different types */
if (o_ptr->code & P4_CONSUME_3_DIFF)
{
/* Check for insufficient types */
if (good_types < 3) break;
/* Cost is 3 goods */
cost = 3;
/* Loop over types */
for (k = GOOD_NOVELTY; k <= GOOD_ALIEN; k++)
{
/* Skip unavailable types */
if (!produce_goods[k]) continue;
/* Use a good */
produce_goods[k]--;
cost--;
/* Check for done paying */
if (!cost) break;
}
/* Award VPs */
count += o_ptr->value;
}
/* Check for consume all different types */
if (o_ptr->code & P4_CONSUME_N_DIFF)
{
/* Loop over types */
for (k = GOOD_NOVELTY; k <= GOOD_ALIEN; k++)
{
/* Skip unavailable types */
if (!produce_goods[k]) continue;
/* Award VPs */
count += o_ptr->value;
/* Consume good */
produce_goods[k]--;
}
}
/* Check for consume all remaining goods */
if (o_ptr->code & P4_CONSUME_ALL)
{
/* Check for insufficient goods */
if (total_goods < 2) break;
/* Award VPs */
count += total_goods - 1;
}
}
}
/* Return count of VP earned */
return count;
}
/*
* List of all advanced game action combinations.
*/
static int adv_combo[ROLE_OUT_ADV_EXP3][2] =
{
{ ACT_EXPLORE_5_0, ACT_EXPLORE_1_1 },
{ ACT_EXPLORE_5_0, ACT_DEVELOP },
{ ACT_EXPLORE_5_0, ACT_SETTLE },
{ ACT_EXPLORE_5_0, ACT_CONSUME_TRADE },
{ ACT_EXPLORE_5_0, ACT_CONSUME_X2 },
{ ACT_EXPLORE_5_0, ACT_PRODUCE },
{ ACT_EXPLORE_1_1, ACT_DEVELOP },
{ ACT_EXPLORE_1_1, ACT_SETTLE },
{ ACT_EXPLORE_1_1, ACT_CONSUME_TRADE },
{ ACT_EXPLORE_1_1, ACT_CONSUME_X2 },
{ ACT_EXPLORE_1_1, ACT_PRODUCE },
{ ACT_DEVELOP, ACT_DEVELOP2 },
{ ACT_DEVELOP, ACT_SETTLE },
{ ACT_DEVELOP, ACT_CONSUME_TRADE },
{ ACT_DEVELOP, ACT_CONSUME_X2 },
{ ACT_DEVELOP, ACT_PRODUCE },
{ ACT_SETTLE, ACT_SETTLE2 },
{ ACT_SETTLE, ACT_CONSUME_TRADE },
{ ACT_SETTLE, ACT_CONSUME_X2 },
{ ACT_SETTLE, ACT_PRODUCE },
{ ACT_CONSUME_TRADE, ACT_CONSUME_X2 },
{ ACT_CONSUME_TRADE, ACT_PRODUCE },
{ ACT_CONSUME_X2, ACT_PRODUCE }
};