Choose your tool

PUZZLES TOOL

Grid Maze Shortest Path Finder

Online grid maze shortest path finder. No diagonal moves, weights, doors or keys.

â—‡ Browser only
0 lines · 0 characters
Ready when you are
Your results will appear here.
Copy or download your result below.
LESS BUSYWORK, MORE DONE

Three steps. That’s it.

A useful toolkit for text, data, images and calculations.

  1. 01

    Add your input

    Choose a tool, enter values or select a file.

  2. 02

    Make it yours

    Adjust the options and run the action.

  3. 03

    Take the result

    Copy the result or download its file.

grid maze shortest path finder online

Use grid maze shortest path finder online for Puzzle input — follow the example. No diagonal moves, weights, doors or keys. Bounded local puzzle processing. Search limits and supported input formats are described for each tool.

How to use it

Select Try example and follow its grid, word-list or JSON shape. Change the options if needed, select Run tool, then copy or download the JSON result.

Options and example settings

OptionChoices / valueExample default
Puzzle input — follow the exampleUse the grid, word list or JSON shape in the worked example.S..#.. .#.#.. .#.... .###.# .....E

Calculation method

Breadth-first search using four orthogonal moves and # walls.

Worked examples

Apply grid maze shortest path finder to the case below, keeping the displayed units and assumptions. No diagonal moves, weights, doors or keys.

Grid Maze Shortest Path Finder — worked case

Settings: No additional options

Input:

S..#..
.#.#..
.#....
.###.#
.....E

Calculated result for these inputs:

Output:

{
  "found": true,
  "steps": 9,
  "path_zero_based": [
    [
      0,
      0
    ],
    [
      1,
      0
    ],
    [
      2,
      0
    ],
    [
      3,
      0
    ],
    [
      4,
      0
    ],
    [
      4,
      1
    ],
    [
      4,
      2
    ],
    [
      4,
      3
    ],
    [
      4,
      4
    ],
    [
      4,
      5
    ]
  ]
}

Choose the right tool

Choose a checker to validate a supplied grid and a solver to search for answers. Generators use reproducible seeds. Read uniqueness, unplaced-word and truncation flags before treating an output as complete.

Limitations and common mistakes

  • No diagonal moves, weights, doors or keys. Bounded local puzzle processing. Search limits and supported input formats are described for each tool.
  • Use the exact symbols, row sizes and JSON keys shown in the worked example. Check any limit or incomplete-result flags.

Frequently asked questions

How can I use grid maze shortest path finder online?

Select Try example and follow its grid, word-list or JSON shape. Change the options if needed, select Run tool, then copy or download the JSON result.

Where is my input processed?

The bundled tool processes input in your browser. It does not upload tool input to a conversion service. Other site plugins, analytics, advertising and browser extensions may have separate behavior.

Useful next tools

Explore other tools

Open a tool below, use the search, or choose a category to browse its full collection.