Worked example
On an open 3×3 grid, start in the top-left corner and aim for the bottom-right. Breadth-first search checks cells one move away, then two moves away. The first time it reaches the goal, it can trace back a route with four moves.
💻 Coding games · free, no sign-up
Pathfinding: find a way through.
Play Pathfinding Visualizer
Loading Pathfinding Visualizer…
How to play Pathfinding Visualizer
- Click empty cells to add or remove walls.
- Keep the start and finish cells clear.
- Press Find path to run breadth-first search.
- Clear the route or make a new maze and compare.
Tips and strategy
- The search checks nearby cells before moving farther away.
- A wall blocks movement; a longer route may be the only route.
- If no path appears, remove some walls and try again.
Learn beyond the game
Explore the idea behind Pathfinding Visualizer
Common sticking point
Visited cells show where the search looked; they are not all part of the final route. Breadth-first search may explore several branches before it can prove that a shortest route has been found.
Try it away from the screen
Draw a 5×5 grid, add a few walls, and use scraps of paper as a queue. Put the start cell in first, then add each open neighbour once. Mark the distance layer as you go.
Mini challenge
On a 3×3 grid, block only the centre cell. From the top-left to the bottom-right, what is the shortest distance, and how many shortest routes avoid the wall?
Show the answer
The shortest distance is four moves. Two shortest routes avoid the centre: go across the top then down, or down the left side then across the bottom.
How to use this practice path
Run the search on the ready-made maze, then add one wall at a time and compare how many cells are visited. For a different algorithmic idea, try the Sorting Visualizer.
Where the idea goes next
This grid gives every move the same cost. When routes have different costs, algorithms such as Dijkstra's search keep track of the total cost as well as the number of steps.
Keep playing
More games you might like
Coding games · Ages 10+NewSorting VisualizerWatch bubble, insertion and selection sort organise a row of numbers.
algorithmssorting
Play
Coding games · Ages 7+NewCode the RobotPlan a short command sequence to guide a robot through a grid maze.
sequencedebugging
Play
Coding games · Ages 9+NewPython Practice LabWrite real beginner Python, run it in the browser and solve small challenges.
Pythonvariables
Play
Coding games · Ages 7+NewCode JungleWrite real Python to guide Miko the monkey to every banana. 24 levels: sequences, loops and logic.
Sequences → Loops → Logic
Start the adventure
FAQ
Pathfinding Visualizer: questions
Is this the same as Google Maps?
No. It is a small grid demonstration of breadth-first search; real maps include roads, travel time and many other constraints.
Can I draw my own maze?
Yes. Click cells to place or remove walls, then run the search.
Start a conversation
Questions about classes?
A parent or guardian can share the learner's age, level and goals, and we'll suggest a starting point and confirm the format before anything is booked.
- Tell us the learner’s age or grade and goals
- We’ll suggest a suitable class or learning path
- We’ll confirm format, timing and fees with a parent or guardian