Bayesian Programming and Learning for Multi-Player Video Games ...

Appendix B
StarCraft AI
B.1 Micro-management
Algorithm 8 (Simplified) Target selection heuristic, efficiently implemented with a enemy units
↔ damages bidirectional map: bimap : u, d → (left : u → d, right : d → u)
function on_death(unit)
remove_incoming_damages(unit.target, damages(unit, unit.target))
end function
function register_target(unit, target)
add_incoming_damages(target, damages(unit, target))
unit.target ← target
end function
function select_target(unit)
for all eunit ∈ focus_fire_order(enemy_units) do
if eunit.type ∈ priority_targets(unit.type) then
if in_range(unit, eunit) then
register_target(unit, eunit)
else if unit.prio_target == NULL then
unit.prio_target ← eunit
end if
end if
end for
if unit.target == NULL then
for all eunit ∈ focus_fire_order(enemy_units) do
if in_range(unit, eunit) then
register_target(unit, eunit)
end if
end for
end if
if unit.target == NULL and unit.prio_target == NULL then unit.prio_target ←
closer(unit, enemy_units)
end if
end function
197