/**********************************************************************
Find something to bomb
Air-units specific victim search
Returns the want for the best target. The targets are stored in the
path and pptile arguments if not NULL.
TODO: take counterattack dangers into account
TODO: make separate handicaps for air units seeing targets
IMO should be more restrictive than general H_MAP, H_FOG
*********************************************************************/
static int find_something_to_bomb(struct ai_type *ait, struct unit *punit,
struct pf_path **path, struct tile **pptile)
{
struct player *pplayer = unit_owner(punit);
struct pf_parameter parameter;
struct pf_map *pfm;
struct tile *best_tile = NULL;
int best = 0;
pft_fill_unit_parameter(¶meter, punit);
pfm = pf_map_new(¶meter);
/* Let's find something to bomb */
pf_map_move_costs_iterate(pfm, ptile, move_cost, FALSE) {
if (move_cost >= punit->moves_left) {
/* Too far! */
break;
}
if (ai_handicap(pplayer, H_MAP) && !map_is_known(ptile, pplayer)) {
/* The target tile is unknown */
continue;
}
if (ai_handicap(pplayer, H_FOG)
&& !map_is_known_and_seen(ptile, pplayer, V_MAIN)) {
/* The tile is fogged */
continue;
}
if (is_enemy_unit_tile(ptile, pplayer)
&& dai_should_we_air_attack_tile(ait, punit, ptile)
&& can_unit_attack_tile(punit, ptile)) {
int new_best = dai_evaluate_tile_for_air_attack(punit, ptile);
if (new_best > best) {
best_tile = ptile;
best = new_best;
log_debug("%s wants to attack tile (%d, %d)",
unit_rule_name(punit), TILE_XY(ptile));
}
}
} pf_map_positions_iterate_end;
/* Return the best values. */
if (pptile) {
*pptile = best_tile;
}
if (path) {
*path = best_tile ? pf_map_path(pfm, best_tile) : NULL;
}
pf_map_destroy(pfm);
return best;
}
/*****************************************************************************
Find best tile the paratrooper should jump to.
*****************************************************************************/
static struct tile *find_best_tile_to_paradrop_to(struct ai_type *ait,
struct unit *punit)
{
int best = 0;
int val;
struct tile* best_tile = NULL;
int range = unit_type(punit)->paratroopers_range;
struct city* acity;
struct player* pplayer = unit_owner(punit);
/* First, we search for undefended cities in danger */
square_iterate(unit_tile(punit), range, ptile) {
if (!map_is_known(ptile, pplayer)) {
continue;
}
acity = tile_city(ptile);
if (acity && city_owner(acity) == unit_owner(punit)
&& unit_list_size(ptile->units) == 0) {
val = city_size_get(acity) * def_ai_city_data(acity, ait)->urgency;
if (val > best) {
best = val;
best_tile = ptile;
}
}
} square_iterate_end;
if (best_tile != NULL) {
acity = tile_city(best_tile);
UNIT_LOG(LOGLEVEL_PARATROOPER, punit,
"Choose to jump in order to protect allied city %s (%d %d). "
"Benefit: %d",
city_name(acity), TILE_XY(best_tile), best);
return best_tile;
}
/* Second, we search for undefended enemy cities */
square_iterate(unit_tile(punit), range, ptile) {
acity = tile_city(ptile);
if (acity && pplayers_at_war(unit_owner(punit), city_owner(acity)) &&
(unit_list_size(ptile->units) == 0)) {
if (!map_is_known_and_seen(ptile, pplayer, V_MAIN)
&& ai_handicap(pplayer, H_FOG)) {
continue;
}
/* Prefer big cities on other continents */
val = city_size_get(acity)
+ (tile_continent(unit_tile(punit)) != tile_continent(ptile));
if (val > best) {
best = val;
best_tile = ptile;
}
}
} square_iterate_end;