Basemodule listObservableTiles performance

[AODtorusan]

The method listObservableTiles in basemodule, checks each tile if it is within the viewrange. The performance can be significantly increased simply listing the tiles within a fixed range as follows:

visible = [ ]
for each -N ≤ Δu ≤ N:
    for each max(-N, -Δu-N) ≤ Δy ≤ min(N, -Δu+N)
        Δv = -Δu-Δy
        visible.append(origin + (Δu, Δv) )

Where N is the view range.

Adapted from http://www.redblobgames.com/grids/hexagons/#range

[lhunath]

are you sure dy shouldn't be dv?

[AODtorusan]

No, it should be correct. dy is part of the cubic coordinates, the others are x = u and z = v (y=-u-v).

I inlined these conversions as you don't use cubic coordinates, see the link.

[lhunath]

Any chance you can compress that by including the dv into the second loop?

[AODtorusan]

I think you can also do the following way:

visible = [ ]
for each -N ≤ Δu ≤ N:
    for each max(-Δu, 0) - N ≤ Δv ≤ min(-Δu, 0) + N
        visible.append(origin + (Δu, Δv) )

I quickly check it in mathematica with the following code (and it seems to work):

For[\[Delta]u = -n, \[Delta]u <= n, \[Delta]u++,
 For[\[Delta]v = Max[-\[Delta]u, 0] - n, \[Delta]v <= 
   Min[-\[Delta]u, 0] + n, \[Delta]v++, {
   x = \[Delta]u;
   y = -\[Delta]u - \[Delta]v;
   z = \[Delta]v;
   r = (Abs[x] + Abs[y] + Abs[z])/2;
   (*Print \[Delta]u, \[Delta]v, distance from (0,0) *)
   Print[{\[Delta]u, \[Delta]y, r}]
   }]
 ]