Games & tabletop · focused workspace

Hex Grid Pathfinder

Find a shortest unweighted path across an axial hex grid with blocked cells and export the coordinate route.

Shortest routeCompare scenariosCSV & printable report

Make the next step clearer

Open CSV / project

Preparing the worked example…

Make it yours

Settings & assumptions

Blocked hexes

Your result, explained

02 / RESULTS

Read the result in context

Axial coordinates with six neighbors and equal movement cost. No terrain, line of sight or game-system rules. Input rows are blocked cells.

How to use Hex Grid Pathfinder

Explore the worked example. Mark blocked axial-grid cells and compare a shortest route between a start and destination within the chosen radius.
Replace the blocked hexes with your own entries. Set grid radius, start q, start r, goal q, goal r.
Choose “Find the shortest path”. Review shortest route, then compare the visual overview with the detailed tables.
Capture alternative scenarios, download a reusable project and export the selected table or a report when you are ready.

A starting point

Mark blocked axial-grid cells and compare a shortest route between a start and destination within the chosen radius. The example is illustrative and can be replaced.

Know what you are comparing

What kind of hex coordinates does this use?

Cells use axial q and r coordinates, with the third cube coordinate implied. Breadth-first search finds a minimum-step path when each allowed neighboring move has equal cost.

Files, privacy & saving

Calculations run locally in a browser worker. Input CSV files use the column names in the downloadable template and keep your current settings. Projects restore inputs and up to four scenarios. Imports are limited to 1 MiB and 100 entries. There is no automatic saving. Public pages include advertising and optional analytics; see our privacy policy.

CSV exports contain the entire selected table. JSON and printable HTML reports include all result tables; open the report and use your browser’s Print command for PDF.

Using Hex Grid Pathfinder

Find a shortest unweighted path across an axial hex grid with blocked cells and export the coordinate route.

Explore the worked example. Mark blocked axial-grid cells and compare a shortest route between a start and destination within the chosen radius.
Replace the blocked hexes with your own entries. Set grid radius, start q, start r, goal q, goal r.
Choose “Find the shortest path”. Review shortest route, then compare the visual overview with the detailed tables.
Capture alternative scenarios, download a reusable project and export the selected table or a report when you are ready.

Example

Mark blocked axial-grid cells and compare a shortest route between a start and destination within the chosen radius.

Questions & answers

What kind of hex coordinates does this use?

Cells use axial q and r coordinates, with the third cube coordinate implied. Breadth-first search finds a minimum-step path when each allowed neighboring move has equal cost.

Can I compare and save alternative plans?

Yes. Capture up to four calculated scenarios, restore their inputs and save them in a project JSON file. There is no automatic saving.

How do I bring in my own entries?

Download the CSV template, retain its column names and replace the example rows. Imports are limited to 100 entries and 1 MiB. A saved project also restores settings.

What should I check before using the result?

Axial coordinates with six neighbors and equal movement cost. No terrain, line of sight or game-system rules. Input rows are blocked cells.