I wonder how to calculate these: Hexagonal Tile - Facing Directions
I have thought about two options:
1. Really walk all the path so what determines direction is the movement of the last hex, before you reach the destination, to the final destination hex.
2. Make the ship go a straight line from A to B, determine the angle and then translate it to a possible direction.
Then I have the question about how to spend the direction points your ship probably has.
If we choose the first option we could spend the direction points along all the way, but since this is an hexagonal tile map, going in some directions will spend much more direction points than other directions even if they are the same distance apart from the origin.
If we choose the second option we will need to calculate how much direction points to spend to put the chip into the right direction before moving. So it would spend only once.
Then after arriving at the destination you may spend more direction points to position your ship the way you need it.
It seems the option 2 is better.
I have thought about two options:
1. Really walk all the path so what determines direction is the movement of the last hex, before you reach the destination, to the final destination hex.
2. Make the ship go a straight line from A to B, determine the angle and then translate it to a possible direction.
Then I have the question about how to spend the direction points your ship probably has.
If we choose the first option we could spend the direction points along all the way, but since this is an hexagonal tile map, going in some directions will spend much more direction points than other directions even if they are the same distance apart from the origin.
If we choose the second option we will need to calculate how much direction points to spend to put the chip into the right direction before moving. So it would spend only once.
Then after arriving at the destination you may spend more direction points to position your ship the way you need it.
It seems the option 2 is better.