a linear interpolation from one node 3D location to the other, no Blitz3D collisions required...
once you have a destination node....find the distance between the two nodes and divide by the pac-man speed...this will tell you how many game loop updates will be needed to reach the destination node...then use this value to calculate the X,Y,Z stepper values that are used to posistion the pac-man each game update...then you just set up a counter...start it at zero with the max being the number of game updates required...then for everyup date increase this counter if the player is moveing to the target node and once the counter matches the number of game updates then pac-man has reached the node...if the player decides to turn around midway to the destination node then start subtracting from the counter until it reaches zero at which point pac-man is back at the original node and a new one can be selected and the whole process starts over...
once you have a destination node....find the distance between the two nodes and divide by the pac-man speed...this will tell you how many game loop updates will be needed to reach the destination node...then use this value to calculate the X,Y,Z stepper values that are used to posistion the pac-man each game update...then you just set up a counter...start it at zero with the max being the number of game updates required...then for everyup date increase this counter if the player is moveing to the target node and once the counter matches the number of game updates then pac-man has reached the node...if the player decides to turn around midway to the destination node then start subtracting from the counter until it reaches zero at which point pac-man is back at the original node and a new one can be selected and the whole process starts over...