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

B.3 Strategy
B.4 BroodwarBotQ
Algorithm 9 Flow algorithm making sure there are no convex closures
function init(region)
{diri,j ← list()|(i, j) ∈ region}
updated ← {(i, j)|(i, j) ∈ entrance(region)}
{diri,j ← dir_towards(region)|(i, j) ∈ updated}
while ∃diri,j == list() do
(sources, new_updated) ← neighbours_couples(updated)
for all ((x, y), (i, j)) ∈ (sources, new_updated) do
if (x − i, y − j) /∈ dirx,y then
diri,j.append((i − x, j − y))
end if
end for
updated ← new_updated
end while
end function
function build(i, j)
refill ← list()
for all (x, y) ∈ neighbours(i, j) do ⊲ cut the flow arround
dirx,y.remove((x − i, y − j))
if dirx,y.empty() then
refill.append((x, y))
build(x, y) ⊲ Recursively cut the flow
end if
end for
while ¬fixed_point do ⊲ refill as in the initialization...
current ← dir
for all (x, y) ∈ refill do
if ∃(i, j) ∈ neighbours(x, y) such that currenti,j �= list() then ⊲ non empty flow
dirx,y.append((x − i, y − j))
end if
end for
end while
end function
function is_isolated?(i, j)
if diri,j.empty() then
return True
else
return False
end if
end function
204