I managed to make code to take the player's x and y coordinates, and then collect them again later after the player had moved some unprescribed distance, and determine the distance travelled (assuming a straight line). That code looks like this. (GECK's function for taking any number to the power of anything doesn't work I read, so there's a funky looking square-ing function in there).
;leet maths set tempfloat to ( ((FinishX - StartX) * (FinishX - StartX )) + ((FinishY - StartY) * (FinishY - StartY)) ) set TravelDist to sqrt tempfloat showmessage defaultdebugmsg TravelDist;---
That code works perfect, and I was all happy and stuff.
And then I came to realize that I need to know something more.
I will have another distance value (picked by another means) which is shorter than my result here (TravelDist). I need to create a set of X and Y coordinates that exists at this distance, and along the same straight line that theoretically exists between the player's StartX/StartY and FinishX/FinishY.
umm anyone know how to do that?