I've been searching for hex grid algorithms for a while now, but I'm not having much luck.
I'm working on a game that will be using hex grids for the board. There seems to be sufficient resources to manage the A* path finding routines, but trying to find something as simple as determining a set of hexes within a triangle seems to be a real challenge.
An example of what I'm looking for is that I want to have a starting coordinate. I want to get a hex that is 3 hexes to the north/east away from the source hex. I want to get a hex that is 3 hexes to the south/east away from the source hex. I then want to produce a list of all hexes bounded by these 3 hexes.
It should be simple enough, but the fact that rows are staggered is completely confounding me.