110 |
if (num_dragons > MAX_DRAGONS) |
if (num_dragons > MAX_DRAGONS) |
111 |
num_dragons = MAX_DRAGONS; |
num_dragons = MAX_DRAGONS; |
112 |
|
|
113 |
for (d1 = 0; d1 < number_of_dragons; d1++) |
for (d1 = 0; d1 < num_dragons; d1++) |
114 |
for (d2 = 0; d2 < number_of_dragons; d2++) { |
for (d2 = 0; d2 < num_dragons; d2++) { |
115 |
semeai_results_first[d1][d2] = -1; |
semeai_results_first[d1][d2] = -1; |
116 |
semeai_results_second[d1][d2] = -1; |
semeai_results_second[d1][d2] = -1; |
117 |
} |
} |
118 |
|
|
119 |
for (d1 = 0; d1 < number_of_dragons; d1++) |
for (d1 = 0; d1 < num_dragons; d1++) |
120 |
for (k = 0; k < dragon2[d1].neighbors; k++) { |
for (k = 0; k < dragon2[d1].neighbors; k++) { |
121 |
int apos = DRAGON(d1).origin; |
int apos = DRAGON(d1).origin; |
122 |
int bpos = DRAGON(dragon2[d1].adjacent[k]).origin; |
int bpos = DRAGON(dragon2[d1].adjacent[k]).origin; |
181 |
safety_to_string(semeai_results_second[d2][d1])); |
safety_to_string(semeai_results_second[d2][d1])); |
182 |
} |
} |
183 |
|
|
184 |
for (d1 = 0; d1 < number_of_dragons; d1++) { |
for (d1 = 0; d1 < num_dragons; d1++) { |
185 |
int semeai_found = 0; |
int semeai_found = 0; |
186 |
int best_result = UNKNOWN; |
int best_result = UNKNOWN; |
187 |
int worst_result = UNKNOWN; |
int worst_result = UNKNOWN; |
188 |
int defense_move = PASS_MOVE; |
int defense_move = PASS_MOVE; |
189 |
int attack_move = PASS_MOVE; |
int attack_move = PASS_MOVE; |
190 |
|
|
191 |
for (d2 = 0; d2 < number_of_dragons; d2++) { |
for (d2 = 0; d2 < num_dragons; d2++) { |
192 |
if (semeai_results_first[d1][d2] == -1) |
if (semeai_results_first[d1][d2] == -1) |
193 |
continue; |
continue; |
194 |
gg_assert (semeai_results_second[d1][d2] != -1) |
gg_assert (semeai_results_second[d1][d2] != -1) |