some illustrations about the aiming algorithm, currently working a bit on it to improve my practical differential equation skills
you see that the ideal position in blue always tries to approach the ideal value. but the interesting part might be the time after 5 seconds. you see that the position value is not able to follow the slope. only when providing the accurate ideal speed, aiming works perfectly.
this image has been produced using quite conservative parameters, therefore no oscillations and slow approaches, but this way the important part is easier to recognize
btw, even with some more oscillations and a "framerate" of 10fps, you see only very little difference between the method currently used and a higher order approximation :
but if you take parameters closer to reality, you might get oscillations when having a low framerate. if you take a higher order approximation, you will have less oscillations like you see now :
ghost of evilspy's idea for storing a kind of vector field for each map representing the main movement directions and speeds sounds nice too, but you mostly aim at targets you already see, therefore you can get the speed information without being accused to have cheated directly
