MedjersoN_HP
Auto-translated
1. Let's say a neutral unit with a speed of 5 needs to reach my unit, which is 3 tiles to the left and 2 tiles down-left diagonally. That is, it stops on the 3rd hex of the defending unit.
The neutral unit will move:
a) - 2 tiles down-left diagonally, then 3 tiles to the left.
b) - 3 tiles to the left, then 2 tiles down-left diagonally.
2. The same situation, but the attacking neutral unit has a speed of 7.
How will the neutral unit move in this case? Is it possible that it will stop on the 1st hex of the defending unit?
1. Answer a. Look at the arrows. Moving left-down has priority over moving left, so it will first move 2 steps left-down.
2. No, it won't. It will choose the shortest path, unless there are additional conditions (for example, if stopping on hex 1 would block an archer).
P.S. Of course, I don't know the AI algorithms; this is all based on experience. But the description of pathfinding in FizMiga is similar to the A* algorithm.
В тихой однообразной жизни всегда так бывает: каждый отдельный день бесконечно долог, но месяцы и годы мчатся с непостижимой быстротой.
I wanted to offer you some flowers, but a crown would suit a princess like you much better
Смысл жизни в том, что жизнь на тебе не заканчивается
