Hexagonal grids are used in some games but aren’t quite as straightforward or common as square grids. I’ve been collecting hex grid resources for over 20 years, and wrote this guide to the most elegant approaches that lead to the simplest code, largely based on the guides by Charles Fu and Clark Verbrugge. I’ll describe the various ways to make hex grids, the relationships between them, as well as some common algorithms. Most parts of this page are interactive.
- Angles, size, spacing
- Coordinate systems
- Line drawing
- Field of view
- Hex to pixel
- Pixel to hex
- Map storage
- Wraparound maps
- More reading
Now let’s assemble hexagons into a grid. With square grids, there’s one obvious way to do it. With hexagons, there are multiple approaches. I recommend using cube coordinates as the primary representation. Use either axial or offset coordinates for map storage, and displaying coordinates to the user.
The most common approach is to offset every other column or row. Columns are named
q). Rows are named
r). You can either offset the odd or the even column/rows, so the horizontal and vertical hexagons each have two variants.
Another way to look at hexagonal grids is to see that there are three primary axes, unlike the two we have for square grids. There’s an elegant symmetry with these.
Let’s take a cube grid and slice out a diagonal plane at
x + y + z = 0. This is a weird idea but it helps us make hex grid algorithms simpler. In particular, we can reuse standard operations from cartesian coordinates: adding coordinates, subtracting coordinates, multiplying or dividing by a scalar, and distances.
Notice the three six hex grid directions are halfway between two of the cube axes. We’ll see this in the neighbors section, where moving along one of the six hex grid directions involves changing two of the coordinates.
Because we already have algorithms for square and cube grids, using cube coordinates allows us to adapt those algorithms to hex grids. I will be using this system for most of the algorithms on the page. To use the algorithms with another coordinate system, I’ll convert to cube coordinates, run the algorithm, and convert back.
Study how the cube coordinates work on the hex grid. Selecting the hexes will highlight the cube coordinates corresponding to the three axes.
- Each direction on the cube grid corresponds to a line on the hex grid. Try highlighting a hex with
zat 0, 1, 2, 3 to see how these are related. The row is marked in blue. Try the same for
- Each direction on the hex grid is a combination of two directions on the cube grid. For example, northwest on the hex grid lies between the
-z, so every step northwest involves adding 1 to
yand subtracting 1 from
The cube coordinates are a reasonable choice for a hex grid coordinate system. The constraint is that
x + y + z =
0 so the algorithms must preserve that. The constraint also ensures that there’s a canonical coordinate for each hex.
There are many different valid cube hex coordinate systems. Some of them have constraints other than
x + y + z = 0. I’ve shown only one of the many systems. You can also construct cube coordinates with
x-y, y-z, z-x, and that has its own set of interesting properties, which I don’t explore here.
“But Amit!” you say, “I don’t want to store 3 numbers for coordinates. I don’t know how to store a map that way.”
The axial coordinate system, sometimes called “trapezoidal”, is built by taking two of the three coordinates from a cube coordinate system. Since we have a constraint
x + y + z = 0, there’s some redundancy, and we don’t need to store all three coordinates. This diagram is the same as the previous one, except I don’t show y:
There are many choices of cube coordinate system, and many choices of axial coordinate system. I’m not going to show all of the combinations in this guide. I’ve chosen
q for “column” =
r as “row” =
z. This choice is arbitary, as you can rotate and flip the diagrams to make many different assignments of ±x,±y,±z to q,r.
The advantage of this system over offset grids is that the algorithms are cleaner when you can use add, subtract, multiply, and divide on hex coordinates. The disadvantage of this system is that storing a rectangular map is a little weird; see the map storage section for ways to handle that. In my projects, I name the axes
s so that I have the constraint
q + r + s = 0, and then I can calculate
s = -q - r when I need the third coordinate for algorithms that work better with cube coordinates.
Offset coordinates are the first thing people think of, because they match the standard cartesian coordinates used with square grids. Unfortunately one of the two axes has to go “against the grain”, and ends up complicating things. The cube and axial systems go “with the grain” and have simpler algorithms, but slightly more complicated map storage. There’s also another system, called interlaced or doubled, that I haven’t explored here; some people say it’s easier to work with than cube/axial.
The axis is the direction in which that coordinate increases. Perpendicular to the axis is a line where that coordinate stays constant. The grid diagrams above show the perpendicular line.
It is likely that you will use axial or offset coordinates in your project, but many algorithms are simpler to express in cube coordinates. Therefore you need to be able to convert back and forth.
Given a hex, which 6 hexes are neighboring it? As you might expect, the answer is simplest with cube coordinates, still pretty simple with axial coordinates, and slightly trickier with offset coordinates. We might also want to calculate the 6 “diagonal” hexes.
With offset coordinates, the change depends on where in the grid we are. If we’re on an offset column/row then the rule is different than if we’re on a non-offset column/row.
As above, we’ll build a table of the numbers we need to add to
row. However offset coordinates can’t be safely added and subtracted. Instead, the results are different for odd and even columns/rows, so we will need two separate lists of neighbors. Look at
(1,1) on the grid map above and see how
row change as you move in each of the six directions. Then do this again for
(2,2). The tables and code are different for each of the four offset grid types, so pick a grid type to see the corresponding code.
Using the above lookup tables is the easiest way to to calculate neighbors. It’s also possible to derive these numbers, for those of you who are curious.
In the cube coordinate system, each hexagon is a cube in 3d space. Adjacent hexagons are distance 1 apart in the hex grid but distance 2 apart in the cube grid. This makes distances simple. In a square grid, Manhattan distances are
abs(dx) + abs(dy). In a cube grid, Manhattan distances are
abs(dx) + abs(dy) + abs(dz). The distance on a hex grid is half that:
function cube_distance(a, b): return (abs(a.x - b.x) + abs(a.y - b.y) + abs(a.z - b.z)) / 2
An equivalent way to write this is by noting that one of the three coordinates must be the sum of the other two, then picking that one as the distance. You may prefer the “divide by two” form above, or the “max” form here, but they give the same result:
function cube_distance(a, b): return max(abs(a.x - b.x), abs(a.y - b.y), abs(a.z - b.z))
The maximum of the three coordinates is the distance. You can also use the max of
abs(dz-dx) to figure out which of the 6 “wedges” a hex is in; see diagrams here.
In the axial system, the third coordinate is implicit. Let’s convert axial to cube to calculate distance:
function hex_distance(a, b): var ac = axial_to_cube(a) var bc = axial_to_cube(b) return cube_distance(ac, bc)
If your compiler inlines
cube_distance, it will generate this code:
function hex_distance(a, b): return (abs(a.q - b.q) + abs(a.q + a.r - b.q - b.r) + abs(a.r - b.r)) / 2
There are lots of different ways to write hex distance in axial coordinates, but no matter which way you write it, axial hex distance is derived from the Mahattan distance on cubes. For example, the “difference of differences” described here results from writing
a.q + a.r - b.q - b.r as
a.q - b.q + a.r - b.r, and using “max” form instead of the “divide by two” form of
cube_distance. They’re all equivalent once you see the connection to cube coordinates.
As with axial coordinates, we’ll convert offset coordinates to cube coordinates, then use cube distance.
function offset_distance(a, b): var ac = offset_to_cube(a) var bc = offset_to_cube(b) return cube_distance(ac, bc)
We’ll use the same pattern for many of the algorithms: convert hex to cube, run the cube version of the algorithm, and convert any cube results back to hex coordinates (whether axial or offset).
Given a hex
center and a range N, which hexes are within N steps from it?
We can work backwards from the hex distance formula,
distance = max(abs(x), abs(y), abs(z)). To find all hexes within N steps, we need
max(abs(x), abs(y), abs(z)) ≤ N. This means we need all three to be true:
abs(x) ≤ N and
abs(y) ≤ N and
abs(z) ≤ N. Removing absolute value, we get
-N ≤ x ≤ N and
-N ≤ y ≤ N and
-N ≤ z ≤ N. In code it’s a nested loop:
var results =  for each -N ≤ x ≤ N: for each -N ≤ y ≤ N: for each -N ≤ z ≤ N: if x + y + z = 0: results.append(cube_add(center, Cube(x, y, z)))
This loop will work but it’s somewhat inefficient. Of all the values of
z we loop over, only one of them actually satisfies the
x + y + z = 0 constraint on cubes. Instead, let’s directly calculate the value of
z that satisfies the constraint:
var results =  for each -N ≤ x ≤ N: for each max(-N, -x-N) ≤ y ≤ min(N, -x+N): var z = -x-y results.append(cube_add(center, Cube(x, y, z)))
This loop iterates over exactly the needed coordinates. In the diagram, each range is a pair of lines. Each line is an inequality. We pick all the hexes that satisfy all six inequalities.
If you need to find hexes that are in more than one range, you can intersect the ranges before generating a list of hexes.
You can either think of this problem algebraically or geometrically. Algebraically, each region is expressed as inequality constraints of the form
-N ≤ dx ≤ N, and we’re going to solve for the intersection of those constraints. Geometrically, each region is a cube in 3D space, and we’re going to intersect two cubes in 3D space to form a cuboid in 3D space, then project back to the x + y + z = 0 plane to get hexes. I’m going to solve it algebraically:
First, we rewrite constraint
-N ≤ dx ≤ N into a more general form,
xmin ≤ x ≤
xmax, and set
xmin = center.x
- N and
xmax = center.x + N. We’ll do the same for
z, and end up with this generalization of the code from the previous section:
var results =  for each xmin ≤ x ≤ xmax: for each max(ymin, -x-zmax) ≤ y ≤ min(ymax, -x-zmin): var z = -x-y results.append(Cube(x, y, z))
The intersection of two ranges
a ≤ x ≤ b and
c ≤ x ≤ d is
max(a, c) ≤ x ≤ min(b,
d). Since a hex region is expressed as ranges over x, y, z, we can separately intersect each of the x, y, z ranges then use the nested loop to generate a list of hexes in the intersection. For one hex region we set
xmin = H.x - N and
xmax = H.x + N and likewise for
z. For intersecting two hex regions we set
xmin = max(H1.x -
N, H2.x - N) and
min(H1.x + N, H2.x + N), and likewise for
z. The same pattern works for intersecting three or more regions.
If there are obstacles, the simplest thing to do is a distance-limited flood fill (breadth first search). In this diagram, the limit is set to moves. In the code,
fringes[k] is an array of all hexes that can be reached in
k steps. Each time through the main loop, we expand level
k-1 into level
function cube_reachable(start, movement): var visited = set() # set of cubes add start to visited var fringes =  # array of arrays of cubes fringes.append([start]) for each 1 < k ≤ movement: fringes.append() for each cube in fringes[k-1]: for each 0 ≤ dir < 6: var neighbor = cube_neighbor(cube, dir) if neighbor not in visited and not blocked: add neighbor to visited fringes[k].append(neighbor) return visited
Given a hex vector (difference between one hex and another), we might want to rotate it to point to a different hex. This is simple with cube coordinates if we stick with rotations of 1/6th of a circle.
A rotation 60° right shoves each coordinate one slot to the right:
[ x, y, z] to [-z, -x, -y] to [y, z, x]
A rotation 60° left shoves each coordinate one slot to the left:
[ x, y, z] to [-y, -z, -x] to [ z, x, y]
As you play with diagram, notice that each 60° rotation flips the signs and also physically “rotates” the coordinates. Take a look at the axis legend on the bottom left to see how this works. After a 120° rotation the signs are flipped back to where they were. A 180° rotation flips the signs but the coordinates have rotated back to where they originally were.
Here’s the full recipe for rotating a position P around a center position C to result in a new position R:
- Convert positions P and C to cube coordinates.
- Calculate a vector by subtracting the center:
P_from_C = P - C = Cube(P.x - C.x, P.y - C.y, P.z - C.z).
- Rotate the vector
P_from_Cas described above, and call the resulting vector
- Convert the vector back to a position by adding the center:
R = R_from_C + C = Cube(R_from_C.x + C.x, R_from_C.y + C.y, R_from_C.z + C.z).
- Convert the cube position R back to to your preferred coordinate system.
It’s several conversion steps but each step is simple. You can shortcut some of these steps by defining rotation directly on axial coordinates, but hex vectors don’t work for offset coordinates and I don’t know a shortcut for offset coordinates. Also see this stackexchange discussion for other ways to calculate rotation.
To find out whether a given hex is on a ring of a given
radius, calculate the distance from that hex to the center and see if it’s
radius. To get a list of all such hexes, take
radius steps away from the center, then follow the rotated vectors in a path around the ring.
function cube_ring(center, radius): var results =  # this code doesn't work for radius == 0; can you see why? var cube = cube_add(center, cube_scale(cube_direction(4), radius)) for each 0 ≤ i < 6: for each 0 ≤ j < radius: results.append(cube) cube = cube_neighbor(cube, i) return results
In this code,
cube starts out on the ring, shown by the large arrow from the center to the corner in the diagram. I chose corner 4 to start with because it lines up the way my direction numbers work but you may need a different starting corner. At each step of the inner loop,
cube moves one hex along the ring. After
6 * radius steps it ends up back where it started.
Traversing the rings one by one in a spiral pattern, we can fill in the interior:
function cube_spiral(center, radius): var results = [center] for each 1 ≤ k ≤ radius: results = results + cube_ring(center, k) return results
The area of the larger hexagon will be the sum of the circumferences, plus 1 for the center; use this formula to help you calculate the area.
Visiting the hexes this way can also be used to calculate movement range.
#Field of view
Given a location and a distance, what is visible from that location, not blocked by obstacles? The simplest way to do this is to draw a line to every hex that’s in range. If the line doesn’t hit any walls, then you can see the hex. Mouse over a hex to see the line being drawn to that hex, and which walls it hits.
This algorithm can be slow for large areas but it’s so easy to implement that it’s what I recommend starting with.
There are many different ways to define what’s “visible”. Do you want to be able to see the center of the other hex from the center of the starting hex? Do you want to see any part of the other hex from the center of the starting point? Maybe any part of the other hex from any part of the starting point? Are there obstacles that occupy less than a complete hex? Field of view turns out to be trickier and more varied than it might seem at first. Start with the simplest algorithm, but expect that it may not compute exactly the answer you want for your project. There are even situations where the simple algorithm produces results that are illogical.
Clark Verbrugge’s guide describes a “start at center and move outwards” algorithm to calculate field of view. Also see the Duelo project, which has an an online demo of directional field of view and code on Github. Also see my article on 2d visibility calculation for an algorithm that works on polygons, including hexagons. For grids, the roguelike community has a nice set of algorithms for square grids (see this and this and this); some of them might be adapted for hex grids.
#Hex to pixel
For hex to pixel, it’s useful to review the size and spacing diagram at the top of the page.
#Pixel to Hex
#Rounding to nearest hex
Sometimes we’ll end up with a floating-point cube coordinate
(x, y, z), and we’ll want to know which hex it should be in. This comes up in line drawing and pixel to hex. Converting a floating point value to an integer value is called rounding so I call this algorithm
With cube coordinates,
x + y + z = 0, even with floating point cube coordinates. So let’s round each component to the nearest integer,
(rx, ry, rz). However, although
x + y + z = 0, after rounding we do not have a guarantee that
rx + ry + rz = 0. So we reset the component with the largest change back to what the constraint
rx + ry + rz = 0 requires. For example, if the y-change
abs(ry-y) is larger than
abs(rz-z), then we reset
ry = -rx-rz. This guarantees that
rx + ry + rz = 0. Here’s the algorithm:
function cube_round(cube): var rx = round(cube.x) var ry = round(cube.y) var rz = round(cube.z) var x_diff = abs(rx - cube.x) var y_diff = abs(ry - cube.y) var z_diff = abs(rz - cube.z) if x_diff > y_diff and x_diff > z_diff: rx = -ry-rz else if y_diff > z_diff: ry = -rx-rz else: rz = -rx-ry return Cube(rx, ry, rz)
For non-cube coordinates, the simplest thing to do is to convert to cube coordinates, use the rounding algorithm, then convert back:
function hex_round(hex): return cube_to_axial(cube_round(axial_to_cube(hex)))
The same would work if you have
evenq instead of
hex_round take float coordinates instead of int coordinates. If you’ve written a Cube and Hex class, they’ll work fine in dynamically typed languages where you can pass in floats instead of ints, and they’ll also work fine in statically typed languages with a unified number type. However, in most statically typed languages, you’ll need a separate class/struct type for float coordinates, and
cube_round will have type
FloatCube → Cube. If you also need
hex_round, it will be
FloatHex → Hex, using helper function
floatcube_to_floathex instead of
cube_to_hex. In languages with parameterized types (C++, Haskell, etc.) you might define
T is either
float. Alternatively, you could write
cube_round to take three floats as inputs instead of defining a new type just for this function.
#Map storage in axial coordinates
One of the common complaints about the axial coordinate system is that it leads to wasted space when using a rectangular map; that's one reason to favor an offset coordinate system. However all the hex coordinate systems lead to wasted space when using a triangular or hexagonal map. We can use the same strategies for storing all of them.
Notice in the diagram that the wasted space is on the left and right sides of each row (except for rhombus maps) This gives us three strategies for storing the map:
- Ignore the problem. Use a dense array with nulls or some other sentinel at the unused spaces. At most there’s a factor of two for these common shapes; it may not be worth using a more complicated solution.
- Use a hash table instead of dense array. This allows arbitrarily shaped maps, including ones with holes. When you want to access the hex at
hash_table(hash(q,r))instead. Encapsulate this into the getter/setter in a map class so that the rest of the game doesn’t need to know about it.
- Slide the rows to the left, by starting the arrays at the leftmost column instead of at 0. This removes the waste on the left. Optionally, use variable sized rows. In many languages a 2D array is an array of arrays; there’s no reason the arrays have to be the same length. This removes the waste on the right.
Let’s take a closer look at how to use an array of arrays. There’s an array for each row, but we need to know the first column of that row. Map hex
q,r is stored at
array[r - first_row][q - first_column(r)]. Encapsulate this into the getter/setter in a map class so that the rest of the game doesn’t need to know about it.
- For the rectangle shaped map shown here,
first_column(r) == -floor(r/2), so
Hex(q, r)is stored at
array[r][q + floor(r/2)]. This turns out to be equivalent to converting the coordinates into odd-r offset grid coordinates.
- For the triangle shaped map shown here,
first_column(r) == 0, so you’d access
array[r][q]— how convenient! For triangle shaped maps that are oriented the other way (not shown in the diagram), it’s
- For hexagon shaped maps of radius
Ncentered at Hex(N, N, -2*N),
first_column(r) == max(0, N-r), so you’d access
array[r][q - max(0, N-r)].
- For the rhombus shaped map here, everything matches nicely, so you can use
Your maps won’t look exactly like the ones here so you’ll need to adapt
first_column(r) to your own maps. If you are using flat-topped hexes, it will be easier to swap the roles of the rows and columns, and use
array[q - first_column][r - first_row(q)].
In some games you want the map to “wrap” around the edges. In a square map, you can either wrap around the x-axis only (roughly corresponding to a sphere) or both x- and y-axes (roughly corresponding to a torus). Wraparound depends on the map shape, not the tile shape. To wrap around a rectangular map is easy with offset coordinates. I’ll show how to wrap around a hexagon-shaped map with cube coordinates.
Corresponding to the center of the map, there are six “mirror” centers. When you go off the map, you subtract the mirror center closest to you until you are back on the main map. In the diagram, try exiting the center map, and watch one of the mirrors enter the map on the opposite side.
The simplest implementation is to precompute the answers. Make a lookup table storing, for each hex just off the map, the corresponding cube on the other side. For each of the six mirror centers
M, and each of the locations on the map
mirror_table[cube_add(M, L)] = L. Then any time you calculate a hex that’s in the mirror table, replace it by the unmirrored version. See stackoverflow for another approach.
For a hexagonal shaped map with radius
N, the mirror centers will be
Cube(2*N+1, -N, -N-1) and its six rotations.
If you’re using graph-based pathfinding such as A* or Dijkstra’s algorithm or Floyd-Warshall, pathfinding on hex grids isn’t different from pathfinding on square grids. The explanations and code from my pathfinding tutorial will work equally well on hexagonal grids.
Mouse overTouch a hex in the diagram to see the path to it. Click or drag to toggle walls.
- Neighbors. The sample code I provide in the pathfinding tutorial calls
graph.neighborsto get the neighbors of a location. Use the function in the neighbors section for this. Filter out the neighbors that are impassable.
- Heuristic. The sample code for A* uses a
heuristicfunction that gives a distance between two locations. Use the distance formula, scaled to match the movement costs. For example if your movement cost is 5 per hex, then multiply the distance by 5.
- In my Guide to Grids, I cover axial coordinate systems to address square, triangle, and hexagon sides and corners, and algorithms for the relationships among tiles, sides, and corners. I also show how square and hex grids are related.
- The best early guide I saw to the axial coordinate system was Clark Verbrugge’s guide, written in 1996.
- The first time I saw the cube coordinate system was from Charles Fu’s posting to rec.games.programmer in 1994.
- DevMag has a nice visual overview of hex math including how to represent areas such as half-planes, triangles, and quadrangles. There’s a PDF version here that goes into more detail. Highly reocmmended! The GameLogic Grids library implements these and many other grid types in Unity.
- James McNeill has a nice visual explanation of grid transformations.
- Overview of hex coordinate types: staggered (offset), interlaced, 3d (cube), and trapezoidal (axial).
- The Rot.js library has a list of hex coordinate systems: non-orthogonal (axial), odd shift (offset), double width (interlaced), cube.
- Range for cube coordinates: given a distance, which hexagons are that distance from the given one?
- Distances on hex grids using cube coordinates, and reasons to use cube coordinates instead of offset.
- This guide explains the basics of measuring and drawing hexagons, using an offset grid.
- Convert cube hex coordinates to pixel coordinates.
- This thread explains how to generate rings.
- The HexPart system uses both hexes and rectangles to make some of the algorithms easier to work with.
- Are there pros and cons of “pointy topped” and “flat topped” hexagons?
- Line of sight in a hex grid with offset coordinates, splitting hexes into triangles
- Hexnet explains how the correspondence between hexagons and cubes goes much deeper than what I described on this page, generalizing to higher dimensions.
- I used the PDF hex grids from this page while working out some of the algorithms.
- Generalized Balanced Ternary for hex coordinates seems interesting; I haven’t studied it.
- Hex-Grid Utilities is a C# library for hex grid math, with neighbors, grids, range finding, path finding, field of view. Open source, MIT license.
- The Reddit discussion and Hacker News discussion and MetaFilter discussion have more comments and links.
The code that powers this page is partially procedurally generated! The core algorithms are in lib.js, generated from my guide to implementation. There are a few more algorithms in hex-algorithms.js. The interactive diagrams are in diagrams.js and index.js, using Vue.js to inject into the templates in index.bxml (xhtml I feed into a preprocessor).
There are more things I want to do for this guide. I’m keeping a list on Trello. Do you have suggestions for things to change or add? Comment below.