@teahands@gamedev you probably want to start by looking up A* pathfinding. Essentially it's just a way of calculating the shortest route between two places by scoring each adjacent tile from every other, based on how many hops it took to get there. Same maths however many adjacents you have so it should work for hex quite nicely. I'm 99.9% certain a YouTube search will explain better than I can...
@teahands @ukcasual I've never been much of a fan of those kinds of chewy sweets to be honest. They're too much hard work to eat 😆
@teahands @ukcasual this is simultaneously every elf in Matt Groening's Disenchantment!
@teahands @ukcasual see, for me, nothing beats that crunch of frozen chocolate. The best bit about a magnum is the crunchy layer it's wrapped up in 😁
Classy though? Pfft. I'm basically a starving Alsatian when it comes to treats. They skim over the taste buds at an astonishing speed 😂
@teahands @ukcasual you like vanilla ice cream, and lemonade lollies? It's like nobody ever told you that chocolate was a thing 🤔
@teahands @gamedev you probably want to start by looking up A* pathfinding. Essentially it's just a way of calculating the shortest route between two places by scoring each adjacent tile from every other, based on how many hops it took to get there. Same maths however many adjacents you have so it should work for hex quite nicely. I'm 99.9% certain a YouTube search will explain better than I can...