Precise MEA

Fragment of a discussion from Talk:Gilgalad/targetingStrategy
← Thread:Talk:Gilgalad/targetingStrategy/Precise MEA/reply (27)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reasons:

The action you have requested is limited to users in the group: Users.
You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

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.

Return to Thread:Talk:Gilgalad/targetingStrategy/Precise MEA/reply (27).

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.

MN‎

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

AW‎

Retrieved from "http://robowiki.net/wiki/Thread:Talk:Gilgalad/targetingStrategy/Precise_MEA/reply_(27)#Precise_MEA_601"