Thread history

Fragment of a discussion from Talk:Gilgalad/targetingStrategy
Viewing a history listing
Jump to navigation Jump to search
Time User Activity Comment
No results

I looked at this, the problem it has is that it doesn't take into account that as the angle changes the wave will hit sooner. You could account for this I guess, but the iterative predictive methods are fast enough, I think.

Skilgannon09:56, 14 February 2012

Something like non-iterative linear targeting can account for varied bullet travel times. But the resulting code will probably be very bulky, like most non-iterative methods.

MN19:09, 14 February 2012

Well, I didn't use a noniterative method and I actually don't know how I could, but I now use a "binary search" for attack angles to get a precise MEA that doesn't take heading or velocity into account. I may make a page for it with diagrams, but for now you would just need to look at the code to see what I mean.

AW17:02, 8 March 2012

I tried a non-iterative MEA in Combat and it is working quite well. It doesn´t take velocity and heading in account, but it does take walls into account.

I modeled the problem as 2 intersecting circunferences (bot moving and bullet moving) and 1 intersecting line (wall). There are at most 2 points where the 3 intersect. Then repeating it for all 4 walls for 8 escape points. Add the 2 escape points from classic MEA (ignoring walls) for 10 escape points. Do some out of bounds checking on all points and then find which remaining 2 gives the widest MEA.

There are some loops but they are fixed and independent from bullet travel time. Making it very cheap to calculate.

I can post the algorithm later.

MN19:42, 8 March 2012

I don't iterate to find the bullet flight time. By iterate I meant for my binary search.

AW21:30, 9 March 2012