
Pathfinding Visualizer
Interactive grid-based pathfinding visualizer supporting A*, Dijkstra, BFS, DFS, and more.
Created by qiao
Create a free account to get instant access
How to Use
This tool demonstrates different pathfinding algorithms by showing how they search for routes on a grid. • Click and drag on the white grid to draw black obstacles/walls • Drag the green node to set your starting position • Drag the red node to set your destination • Select an algorithm from the right panel (A*, Dijkstra, Breadth-First, etc.) • Adjust algorithm options like allowing diagonal movement or choosing heuristics • Click "Start Search" to watch the algorithm find a path in real-time • Use "Pause Search" to stop the animation • Click "Clear Walls" to remove all obstacles The visualization shows: - White cells: walkable spaces - Black cells: obstacles/walls - Green cell: start position - Red cell: end position - Colored cells during search: areas being explored - Final colored line: the discovered path Different algorithms will search in different patterns and may find different routes. Some guarantee the shortest path while others prioritize speed.