Finding adjacent neighbors on a hexagonal grid
问题 EDIT: Wrapped the example map in a code block so the formatting is correct. Ok, I'm trying to write an extremely simple A* algorithm over a hexagonal grid. I understand, and can do the A* portion. In fact, my A* works for square grids. What I can't wrap my brain around is finding neighbors with hexagons. Here's the layout for the heagonal grid 0101 0301 0201 0401 0102 0302 0202 0402 etc, etc So, what I need help with is writing a Hexagon class that, given it's hex coordinates, can generate a