widelands-dev team mailing list archive

[GunChleoc <fios@xxxxxxxxxxxxxxxxxxx>]

Diff comments:

> === modified file 'data/scripting/win_conditions/territorial_functions.lua'
> --- data/scripting/win_conditions/territorial_functions.lua	2019-02-12 17:30:21 +0000
> +++ data/scripting/win_conditions/territorial_functions.lua	2019-02-17 19:27:39 +0000
> @@ -14,24 +14,88 @@
>  local wc_had_territory = _"%1$s had %2$3.0f%% of the land (%3$i of %4$i)."
>  
>  -- RST
> --- .. function:: get_buildable_fields()
> ---
> ---    Collects all fields that are buildable
> ---
> ---    :returns: a table with the map's buildable fields
> ---
> -function get_buildable_fields()
> +-- .. function:: get_valuable_fields()
> +--
> +--    Collects all fields that are valuable
> +--
> +--    :returns: a table with the map's valuable fields
> +--
> +function get_valuable_fields()
>     local fields = {}
> +   local check = {}
>     local map = wl.Game().map
> -   for x=0, map.width-1 do
> -      for y=0, map.height-1 do
> -         local f = map:get_field(x,y)
> -         if f.buildable then
> -            table.insert(fields, f)
> -         end
> -      end
> -   end
> -   return fields
> +   local plrs = wl.Game().players
> +   for idx, player in ipairs(plrs) do
> +      local sf = map.player_slots[idx].starting_field
> +   -- initialize the fields table and the check area with the regions around the starting field of each Player
> +      for idx, fg in ipairs(sf:region(9)) do
> +         local index = fg.x * 1000 + fg.y
> +         fields[index] = fg
> +         check[index] = fg
> +      end
> +   end
> +   if map.allows_seafaring == true then
> +      -- TODO: this check is a little bit consuming, if possible we should read the port spaces from the map

I can try getting around to it this weekend. Ping me if I forget.

> +      for x=0, map.width-1 do
> +         for y=0, map.height-1 do
> +            local f = map:get_field(x,y)
> +            if f:has_max_caps("port") then
> +               for idx, fg in ipairs(f:region(5)) do
> +                  local index = fg.x * 1000 + fg.y
> +                  fields[index] = fg
> +                  check[index] = fg
> +               end
> +            end
> +         end
> +      end
> +   end
> +   local loop = true
> +   while loop do
> +      loop = false
> +      local new = {}
> +      -- checking the check region for buildcaps and add fields that can be conquered
> +      for idx, f in pairs(check) do 
> +         if f:has_max_caps("big") then
> +            local radius = f:region(9)
> +            for idx, fg in ipairs(radius) do
> +               local index = fg.x * 1000 + fg.y
> +               if fields[index] == nil and check[index] == nil and fg:has_max_caps("walkable") then 
> +                  -- if new buildable fields are discovered, add them to the fields table and mark them for checking next loop
> +                  new[index] = fg
> +                  fields[index] = fg
> +                  loop = true
> +               end
> +            end
> +         elseif f:has_max_caps("medium") then
> +            local radius = f:region(7)

Exactly :)

> +            for idx, fg in ipairs(radius) do
> +               local index = fg.x * 1000 + fg.y
> +               if fields[index] == nil and check[index] == nil and fg:has_max_caps("walkable") then 
> +                  new[index] = fg
> +                  fields[index] = fg
> +                  loop = true
> +               end
> +            end
> +         elseif f:has_max_caps("small") then
> +            local radius = f:region(5)
> +            for idx, fg in ipairs(radius) do
> +               local index = fg.x * 1000 + fg.y
> +               if fields[index] == nil and check[index] == nil and fg:has_max_caps("walkable") then 
> +                  new[index] = fg
> +                  fields[index] = fg
> +                  loop = true
> +               end
> +            end
> +         end
> +      end
> +      check = new
> +   end
> +   local result = {}
> +   -- as our fields table is not continuosly indexed we need to build a properly indexed table
> +   for idx,f in pairs(fields) do
> +      table.insert(result, f)
> +   end
> +   return result
>  end
>  
>  -- RST


-- 
https://code.launchpad.net/~widelands-dev/widelands/bug-1810062-territorial-calculations/+merge/361366
Your team Widelands Developers is subscribed to branch lp:~widelands-dev/widelands/bug-1810062-territorial-calculations.