A community about game development.
Rules:
More rules might follow if they become necessary; general rule is don't be a pain in the butt. Have fun! ♥
Basic #pathfinding is not hard. What hard is to make it use less resources and calculate as much paths as possible.
I just throw at you some links to study:
* How to implement A*
https://www.redblobgames.com/pathfinding/a-star/introduction.html
* How to optimize A* for bigger maps
https://www.youtube.com/watch?v=RMBQn_sg7DA
https://www.youtube.com/watch?v=anGdYJu_eH4
https://web.archive.org/web/20190411040123/http://aigamedev.com/open/article/clearance-based-pathfinding/
@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 @gamedev A* ("A star") might be a friendly starting point. It's generally intended for square grids, but a little algebra to get the right distance for the angles might make it possible to extend to hexagons. Even if you don't end up using any part of it, just understanding it might help for fundamentals.
@bluestarultor @gamedev Fundamentals is absolutely what I'm missing here so thank you very much. Baby steps, and all that!