Hex Pathfinding Algorithm

I've created the template with a hex pathfinding algorithm. It's based on 2D Array object. I don't use any additional plugin and behavior (except "MoveTo").

HOW IT WORKS

1. At the beginning, an array is filled with numbers using the "Wave Algorithm" method. This means propagating "waves" around neighboring tiles until the destination point is reached.
2. Then, a revers path is found using a simple subtruction of the index from the current value through a loop.

Basically I used a wave algorithm to fill the array. The main feature is how to determinate neighboring hexes:

Try this on Arcade

Download template

After looking more closely I was wondering how you could assign a movement cost to each hex? Like swamp takes two counts of move vs one for open areas.

It is a very good start.

yours

winkr7

I have implemented this mechanics in another turn-based example (sorry for bad English there). But in that case, I use a square grid of tiles. So, I will update hex-grid template to add movement cost mechanics in few days :)

I am very inspired by the fact that the post above has received so many likes. So I decided to continue developing this template and add new mechanics to it.

So, let's say we want to create a turn-based game. Let's add numerical a variable "MP" (movement points) to the unit and set its value to 3. This way, the unit can move 3 hexes in one turn.

Now let's add new types of hexes: forest and mountains. Let's make it so that a unit can move through all hexes, but each hex will have a different movement cost. For example, the "forest" hexes has a cost of 4 points, the "mountain" costs 6 points, and the regular hexes costs 3 points. Also, we'll set the unit's movement points to 9. And the "water" hexes will remain impassable for the unit.

Now let's add a line to indicate the movement boundary for the unit. It's very simple to do this. We need to check the values of neighboring cells in the array, and if the value of a neighboring cell is greater then the unit's movement points, then we set a boundary line between two hexes.

Like this post if you like my template. Perhaps I will continue to develop this example and add new mechanics to it ;)

Try on Arcade

Download this template

UPDATE

Added the mechanics of infinity map panning, similar to the game Civilization. Imagine your map as a planet. As we know, planets have a spherical shape. You can continuously move in any direction and never reach the edge of map.

How it works:

• I do not use "scroll to" action for movement. Instead, I move the objects themselves.
• When the objects go beyond the screen, I move them to new position.

A more complex task is to adapt the pathfinding to an infinity map. The cells of the array can't be moved as easily as the hex sprites. It would have been an unnecessary complication. So, I came up with simpler solution. Now, the starting position for pathfinding is always at the center of the array.

When a player clicks on a unit, the hexes adjust their virtual coordinates (instance variables) as if the unit were in the center of the map. Thank to this approach, I didn't have to make significant changes to the pathfinding (which is based on 2D array).

Try on Arcade

Download template

Its just a quibble point about topology. You are doing fine work. The wrap around in both x and y, where going around and around leads you back to the same spot (but a unique spot--ie not all going through the north pole) is the topology of a doughnut, not a sphere.

Anyway, I would like to see some rivers as hex sides, or a closest hex function (I don't care about the topology it is fine).

good work

yours

winkr7

PS

To make your work more useful you need a family, call it something like--hexPathable. If a sprite is in this family then you can do the calculations. As it is, you are using a single sprite, called unit and referring to things like unit.x. You want to make unit a member of a family and refer to things like hexPathable.x.

just a suggestion