Suppose we have a rocket A with a position vector and velocity (excluding acceleration, as in many games) and a spaceship B with position and velocity vectors. Now this rocket, the Breakthrough Distortion Cancer, will try to find the best interception for Spacecraft B.
Rocket A has two advantages: it knows the calculus and can calculate the roots of polynomials. However, the rocket, or abstract, the programmer, is still studying calculus and wants to know if it has the correct equation. (Polynomial roots will be solved by a nice guy named Jenkins-Traub Code, implemented from Netlib)
In particular:
mp = Rocket Position
mv = rocket speed
sp = Spacecraft position
sv = Spacecraft speed
t = time
According to the best assumption of the programmer, the equation for interception is: tspsv + tspmv - tmpsv - tmpmv
In addition, I am sure that I am completely on the wrong track, as there must be some exponents in this mess; this is an attempt to solve: (SP-MP) (SV-mv) (t)
My other option distinguishes between (sp-mp) (sv-mv) ^ 2, but I wanted to get feedback first, partly because if I'm not mistaken, '(sp-mp)' allows '1', And it seems ... odd. OTOH, the speed with which this function changes may be what I'm looking for.
So - What did I get wrong, where and why?
Thank.
Potentially useful link to the first stream.
Edit:
Summing up the equations:
(a + bx) + (c + ex)
(a + 1bx ^ 0) + (c + 1ex ^ 0)
(a + 1) + (c + 1)
unviable.
Product Equations:
(a + bx) (c + ex)
ac + aeh + CBX + BEx ^ 2
( Jenkins-Traub) .
+ 1aex ^ 0 + 1cbx ^ 0 + 2bex ^ 1
+ + + CB 2bex
, .