Warfare & Tactics

This guide assumes you have 3 pilots for the 2D case (3 points makes plane) and 4 pilots for the 3D case (4 linearly independent points makes a space). This guide also assumes that you either know a programmer or you are a programmer. It also assumes that have the time, patience and knowledge of tactical overlay to make the required bookmarks.

The 2D case:
Using a total of 4 bookmarks, making a 175km by 175km square graph, one bookmark at the center of the square (origin of the graph), and two bookmarks at the end of the x and y axes of the graph, we can warp anywhere within the 175km x 175km grid. It should be noted that the following method can be adapted to a 3D cube, but for simplicity the 2D case will be described on the forums.

In the picture below, our pilot wants to warp to Point C, which is given by the coordinates (x,y). The pilot starts at the Green Corner, warps partially towards the orange corner, then warps partially towards the red corner, landing precisely on Point C.

http://s28.postimg.org/iduuc09bh/Pinpoint_Warp_by_Saladinae.png

A diagram drawn to scale is the next image:

http://s28.postimg.org/b9uuximb1/Art_of_Warp_1.png


To determine the coordinates (x,y), there must be an OBSERVER in the center (observer 1 at Point B), and two observers equidistant from the centers, preferably at right angles (observers 2 and 3 at points A and D). Although the observers at points at A and D need not be at right angles, nor equidistant from the the center, it makes the math very easy to place them equidistant at a right angle from the center.

A basic application (easily programmed on a hand held graphing calculator) can readily determine the coordinates (x,y) of the target destination. Then it calculates where the red line (through Red Corner and Destination) intersects the side of the square. The application then spits out two values: K and L.

The pilot warps from Green Corner towards Orange Corner "within distance K" then warps towards Red Corner "within distance L"

The image below shows the programmer how to determine which corner is the "start" and "regulator" and "end."
http://s30.postimg.org/d82fsp5wh/No_Dead_Zones_in_Warp_Paradigm.png

Dead Zones:
The title of the above picture is the "No Dead Zones." A Dead Zone is a region which a pilot cannot warp based on the limitations of game engine. Suppose our pilot said EUREKA, I can warp anywhere on a 500km by 500km grid by scaling the distance between the bookmarks!

I'd say: LOL! The "warp within" option is limited to 100km by the game engine. This means an area (starting from the center) is inaccessible, as these points are much further than 100km from any of the corners. The image below shows a massive Dead Zone on the 500km by 500km graph, a 200km by 200km graph, and then a 175 x 175 graph (and 155 by 155 graph). The 200km, 175km and 155km graphs are drawn to scale.

http://s12.postimg.org/mf3ar0cjh/Dead_Zone.png

colored version: http://postimg.org/image/mb7epctd3/1443bb91/

This above image actually shows that the 200km by 200km dead zone is intolerable, so I changed title of thread to 175km by 175km. The grid cannot go below 155km by 155km, since the bookmarked corners must be more than 150km from each other (otherwise you can't initiate warp).

This is an image for a 465km by 465km graph.
http://s15.postimg.org/m40mr6y6j/500_by_500_expansion.png

This is same 465km by 465km graph with positions of 3 observers (3D case requires 3 observers to determine target destination). The programmer must write a code that determines which of the 9 grids (27 cubes in 3D) the target destination is contained within.

http://s28.postimg.org/e5oxv78dp/500_by_500_expansion.png

This image shows the programmer how to warp as close as possible to a target within the Dead Zone:
http://s14.postimg.org/hf577j2ip/How_to_Handle_Dead_Zones.png

The final image shows another use of the system, warp to a point within OPTIMAL RANGE of your target:
http://s7.postimg.org/pyov8f7t7/500_by_500_expansion_with_optimal.png

I will do more updates on this (especially the 3D expansion of the concept) if there are positive reviews of the system being used.

CHeck out the "dead zone" image, which is in the OP. The grid needs to be between 155km by 155km to 180km by 180km, depending upon "dead zone tolerance."

http://postimg.org/image/d7b2ab5h5/

Remember we're also talking about precision warping, not estimation warping.

No. with only two pilots and target you'd have ambiguity.

See image below, tell me which one is correct:
http://s8.postimg.org/wok4fhit1/Ambiguity.png

A third observer makes it into a function (one output).


Also your idea takes a lot of time. With three observers standing still they can all enter their distances towards the target into an application and you get the warp instructions immediately.

If the application has a clock, you can even do motion prediction and warp where the target will be if the target is moving --- upon demand. And with a clock, the observers don't even have to enter their distances at the same time since SIDE-SIDE-SIDE (Observer 1, Target, Observer 2/3 triangle) gives an immediate motion prediction yield, with a WAIT command in the code for the second pilot to resolve the ambiguity to reject the invalid vector.


However, if you didn't have a hostile target and you simply wanted to warp to an (x,y) coordinate, you could do so with NO observers, since you're choosing the (x,y).

On a side note, I'm shocked this thread didn't get more responses. We're all nerds here, don't be shy.

So you're just talking about triangulating a position and warping relative to static BMs. For a moment I thought you were talking about calculating where to intercept a target, but for that you would need to also calculate target speed and heading. So, just to clarify, all of this is only applicable to figure out where to land on a target that is sitting still within the bookmarked area?

CCP just uncapped bookmark count.

:D

I get the impression it won't last very long.

Would CCP allow this type of activity, where you manually feed inputs into a calculator, and the you manually apply the outputs of the calculator for a direct in-game advantage?