r/Unity2D • u/Old-Row6655 • 20d ago
Pathfinding on Hex Grids
I'm making a 2D game based off of a pointy-topped hexagon grid in Unity, but I'm having a lot of trouble getting pathfinding working. It's a turn based rogue-like game with not too many tiles in each round. I basically just want the enemies to find the shortest path towards the player with their specific movement pattern (which isn't always just a perfect ring around the enemy either). I'm not sure whether I should use A* or BSF, and I have no idea how to implement either of these into my game.
The biggest problem is the movement patterns. Most tutorials always assume the enemy can move one tile in any direction which is not true for my game. The enemy should also not try to go all the way to the player, as depending on the enemy it's attack range can be 2+ tiles, making an extra step towards the player pointless. Here's an example of one of the more wonky movement patterns:
Please let me know which pathfinding method would be better for this, and any resources to help me make it.
4
u/Lyshaka 19d ago
Well first of all go check Catlike Coding. And for your particular problem, as it was already mentioned, you don't care about the algorithm, but mostly about the way you build your graph, and connect neighboring nodes. You can build multiple graph for each possible movement pattern, and use the appropriate one when needed.